Submission #1370341

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define forn(i, s, f) for(int i = (s); i <= (f); ++i)
#define for1(i, f, s) for(int i = (f); i >= (s); --i)
#define fora(i, x) for (auto i : x)
#define show(x) cout << #x << " = " << x << " ";
#define skip continue;
#define pb push_back
#define _1 first
#define _2 second

typedef long long ll;

const int N3 = 1e3 + 5;
const int N4 = 1e4 + 5;
const int N5 = 1e5 + 5;
const int N6 = 1e6 + 5;
const int N7 = 1e7 + 5;
const int N8 = 1e8 + 5;
const int N9 = 1e9 + 5;

int n, ans;

int a[N5], can[N5];

ll now[N5];

int main()
{
    cin >> n;
    forn (i, 1, n)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    forn (i, 1, n)
    {
        now[i] += a[i] + now[i - 1];
    }
    for1 (i, n, 1)
    {
        if (i == n)
        {
            can[i] = 1;
            ++ans;
        }
        else
        {
            if (now[i] * 2 >= a[i + 1] && can[i + 1])
                can[i] = 1, ++ans;
        }
    }
    cout << ans;
}

Submission Info

Judge Result