Järjestys

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int t[n];
  for (int i = 0; i < n; ++i) {
    cin >> t[i];
  }
  sort(t, t+n);
  long gstart = 1;
  for (int i = 0; i < n; ++i) {
    if (gstart < t[i]) break;
    gstart += t[i];
  }
  cout << gstart;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER