Submission #1268943

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;
const int MOD = 1e4+7;
long long s[MOD];
int n;
bool cmp(long  x,long  y){
	return x>y;
}
int main(){
	while(scanf("%d",&n)){
		for(int i=0;i<n;i++){
			scanf("%lld",&s[i]);
		}
		sort(s,s+n,cmp);
		long long  sum = 1;
		for(int j=1;j<n;j++){
			int q = 1;
			long long ans = s[j];
			for(int k=j+1;k<n;k++){
					ans+=s[k];
				if(ans*2 > s[0] || ans*2==s[0]){	
					sum++;
					q = 0;
					break;	
				}
			}
			if(q==0) continue;
			for(int o=j-1;o>0;o--){
				if(s[o]<ans*2 || s[o]==ans*2){
					ans+=s[o];
				}
			    if(ans*2>s[0] || ans*2 == s[0]){
			    	sum++;
			    	break;
			    }
			}
		}
		printf("%lld\n",sum);
	}
	return 0;
}

Submission Info

Judge Result