Stack

#include <iostream> 
#include <algorithm> 
#include <map>
#include <vector>

using namespace std;
int main() {
  ios::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 stsum = 0;
  int sth = 0, R = 0;
  for (int i = 0; i < n; ++i) {
    if (!stsum) stsum += t[i], sth = 1;
    else {
      if (stsum < t[i]) {
        stsum += t[i];
        sth++;
      } else {
        stsum -= t[i-1];
        stsum += t[i];
      }
    }
    if (sth > R) R = sth;
  }
  cout << R << endl;
  // map<long, int> sh;
  // int result = 0;
  // for (int i = 0; i < n; ++i) {
  //   auto it = sh.lower_bound(t[i]);
  //   if (it == sh.begin()) {
  //     sh[t[i]] = max(sh[t[i]], 1);
  //     continue;
  //   }
  //   it--;
  //   sh[it->first+t[i]] = max(sh[it->first+t[i]], it->second+1);
  //   result = max(result, it->second+1);
  // }
  // cout << result << endl;
}

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: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER