Submission #1370348

---

Source Code Expand

/*
ID: 5ak0
PROG:
LANG: C++11
*/

#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7, MAXN = 1e5 + 10;

int n, a[MAXN];
ll sum[MAXN];

int main(){
    #ifndef SAKO
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    #endif // SAKO
    ios_base::sync_with_stdio(0);

    cin >> n;
    for (int i = 1; i <= n; ++i)
      cin >> a[i];
    int ans = 0;
    sort (a + 1, a + n + 1);
    for (int i = 1; i <= n; ++i)
        sum[i] = sum[i - 1] + a[i];
    reverse(a + 1, a + n + 1);
    reverse(sum + 1, sum + n + 1);
    for (int i = 1; i <= n; ++i)
        if (a[i] > sum[i + 1] * 2){
            cout << i;
            return 0;
        }

    return 0;
}

Submission Info

Judge Result