Submission #1370327

---

Source Code Expand

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ull unsigned long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
#define y1 what

using namespace std;
 
const int N = (int) 1e5 + 10;
const int M = (int) 101;
const ll big =  (1LL << 51);
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const int INF1 = (int) 1e9 + 3;
const double EPS = (double) 1e-6;
const double PI =  3.14159265359;

int n;
int a[N];

bool good(int clr) {
  multiset<int> st;
  for (int i = 1; i <= n; i++) {
    if (i != clr) st.insert(a[i]);
  }
  ll cur = a[clr];
  while (!st.empty()) {
    auto it = st.upper_bound(cur * 2);
    if (it == st.begin()) return false;
    --it;
    cur += *it;
    st.erase(it);
  }
  return st.empty();
}

int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      if (good(i)) ans++;
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result