Submission #1537576

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
using namespace std;

#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long

int N, A[100005];
ll cum[100005];

int main() {
	
	cin >> N;
	REP(i, N) {
		cin >> A[i];
	}

	sort(A, A + N);

	cum[0] = A[0];
	for (int i = 1;i < N;i++) {
		cum[i] = cum[i - 1] + A[i];
	}

	/*
	REP(i, N) cout << cum[i] << " ";
	cout << endl;
	*/

	int cnt = 0;
	for (int i = N - 2;i >= 0;i--) {//N-1は必ず生き残れる．
		if (cum[i] * 2 >= A[i + 1]) cnt++;
		else break;
	}

	cout << cnt + 1 << endl;
	return 0;
}

Submission Info

Judge Result