Submission #2379302

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000


int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int N; cin >> N;

	int a[N];
	rep(i, N) cin >> a[i];
	sort(a, a + N);
	int ans = 1;
	int size = a[0];
	int combo = 1;
	REP(i, 1, N-1) {
		if (size * 2 >= a[i]) {
			combo++;
		}
		else {
			ans = max(ans, combo);
			combo = 1;
		}
		size += a[i];
		// cout << combo << " " << size << endl;

	}
	cout << max(ans, combo) << endl;




    return 0;
}

Submission Info

Judge Result