Submission #1589552

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <numeric>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>


using namespace std;
using ll = long long;
const ll INF = 1e9;

// Kattobi Editorial Rider
// でんででんででんwwwはやいぜ解説www
// ソートして累積和までわかった
int main() {
    int N;
    cin >> N;
    vector<ll> a(N), sum(N);
    for (int i = 0; i < N; i++) cin >> a[i];
    sort(a.begin(), a.end());
    sum[0] = a[0];
    for (int i = 1; i < N; i++) {
        sum[i] = sum[i-1] + a[i];
    }

    int ans = 1;
    for (int i = N - 2; i >= 0; i--) {
        if (sum[i] * 2 >= a[i+1]) {
            ans++;
        } else {
            break;
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result