提出 #46003181

---

ソースコード 拡げる

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())


void solve(){
    int n, x; cin >> n >> x;
	vector<int> v(n-1);
	for(int i=0;i<n-1;i++) {
		cin >> v[i];
	}

	sort(v.begin(), v.end());

	int sum = accumulate(v.begin()+1, v.begin()+n-2, 0);

	//cout << sum << endl;
	if(sum + v[0] >= x){
		cout << 0 << endl;
	}else if(sum + v.back() >= x){
		cout << max(0, x-sum) << endl;
	}else cout << -1 << endl;
}

int main()
{
	fast_cin();
	ll t = 1;
	// cin >> t;
	for(int it=1;it<=t;it++) {
		// cout << "Case #" << it << ": ";
			solve();
	}
	
	return 0;
}

提出情報

ジャッジ結果