Submission #45821292

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<int,int> pii;
const int maxn=2e5+10;
const int maxs=(1<<20)+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const ll llinf=0x3f3f3f3f3f3f3f3f;
const db eps=1e-9;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int n,x;
int a[maxn],b[maxn];
char s[maxn];
multiset<int> S;
inline bool check(){
    S.clear();
    int sum=0;
    for(int i=1;i<=n;++i){
        sum+=a[i];
        S.insert(a[i]);
    }
    sum-=*S.begin();
    sum-=*S.rbegin();
    return sum>=x;
}

int main(){
    n=read(),x=read();
    for(int i=1;i<n;++i) a[i]=read();
    for(int j=0;j<=100;++j){
        a[n]=j;
        if(check()) return printf("%d\n",j),0;
    }
    printf("-1\n");
    return 0;
}

Submission Info

Judge Result