Submission #1627408

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
ll n,t[100005],ans;
int main(){
	cin>>n;
	rep(i,n)cin>>t[i];
	sort(t,t+n);
	int ok = 0;
	rep(i,n){
		if(i>0) t[i]+=t[i-1];
		if(i!=n-1 && t[i]*2 < t[i+1]){
			ok = i+1;
		}
	}
	cout<<n-ok<<endl;
}

Submission Info

Judge Result