Submission #1268954


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;
const int MOD = 100010;
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++){
			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++;
					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

Submission Time
Task B - Colorful Creatures
User vjudge1
Language C++14 (Clang 3.8.0)
Score 0
Code Size 698 Byte
Status TLE
Exec Time 2103 ms
Memory 2560 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
TLE × 3
TLE × 19
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt TLE 2103 ms 1024 KB
in10.txt TLE 2103 ms 512 KB
in11.txt TLE 2103 ms 1024 KB
in12.txt TLE 2103 ms 1024 KB
in13.txt TLE 2103 ms 1024 KB
in2.txt TLE 2103 ms 1024 KB
in3.txt TLE 2103 ms 1024 KB
in4.txt TLE 2103 ms 1024 KB
in5.txt TLE 2103 ms 512 KB
in6.txt TLE 2103 ms 1024 KB
in7.txt TLE 2103 ms 1024 KB
in8.txt TLE 2103 ms 1024 KB
in9.txt TLE 2103 ms 384 KB
sample1.txt TLE 2103 ms 2560 KB
sample2.txt TLE 2103 ms 1920 KB
sample3.txt TLE 2103 ms 1664 KB