Submission #1157583

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll=long long;

int main() {
  int n; cin >> n;
  vector<int> A(n);
  vector<ll> psum;
  ll cur = 0;
  
  for(int &a:A) cin >> a;
  sort(A.begin(), A.end());
  for(int a:A) {
    cur += a;
    psum.push_back(cur);
  }

  int res;

  for(int i = 0; i < n; i++) {
    cur = psum[i];
    int j = i+1;
    while(j < n) {
      if(cur*2 >= A[j]) {
        cur += A[j];
        j++;
      }
      else break;
    }
    if (j == n) res++;
  }

  cout << res << endl;

  return 0;
}

Submission Info

Judge Result