Kolikot

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

long long a,b,c,x,y;
int main(){
    cin>>a;
    vector<long long> v(a+1); 
    vector<long long> s(a+1);
      for(int i=0; i<a; i++){
          cin>>x;
          v[i]=x;
          
          }
    
    sort(v.begin(),v.end());
     
     for(int i=0; i<a+1; i++){
          b+=v[i];
         s[i]=b;
          }
   long long i=0;
    y=1;
    c=v[0];
    while(i<=a){
        if(min(y,c)==1 && c!=1){
            cout<<1;
            break;}
        
        if(v[i+1]>s[i]+1){ 
            cout<<s[i]+1;
            break;}
            
        else i++;
            
    }
    }
        

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: ACCEPTED