Missing Coin Sum

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
#include <map>
using namespace std;
typedef long long ll;

void task1(){
ll n, k; 
    cin >> n >> k;

    vector<ll> arr(n);
    for(ll i = 0; i < n; i++){
        cin >> arr[i];
    }

    
    map<ll, ll> map;
    map[0] = 1;

    ll sum = 0;
    ll total = 0;

    for (ll i = 0; i < n; i++) {

        sum += arr[i];

        ll req = sum - k;

        if (map.count(req)) {
            total += map[req];
        }

        map[sum]++;
    }


    cout << total << endl;
}

void task2(){

    ll n;
    cin >> n;

    vector<ll> arr(n);
    for (ll i = 0; i < n; i++) {
        cin >> arr[i];
    }

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

    ll maxSum = 0; 

    for (ll coin_value : arr) {
        if (coin_value > maxSum + 1) {
            break;
        }

        maxSum += coin_value;
    }

    cout << maxSum + 1 << endl;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    task2();

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED