Submission #2007010


Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <cstdio>
#define INF 1000000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;

int main(){
	int n;
	cin >> n;
	int a[n];
	REP(i, n) cin >> a[i];
	sort(a, a+n);
	int b[n];
	b[0] = a[0];
	FOR(i, 1, n) b[i] = b[i-1] + a[i];
	int ans = 0;
	int f = 1;
	int c = n-1;
	while(f == 1){
		if(c == 0 || 2*b[c-1] < a[c]) f = 0;
		ans++;
		c--;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Colorful Creatures
User EctoPlasma
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1019 Byte
Status WA
Exec Time 60 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 6
WA × 13
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 WA 59 ms 1024 KB
in10.txt WA 18 ms 512 KB
in11.txt WA 50 ms 1024 KB
in12.txt WA 59 ms 1024 KB
in13.txt WA 60 ms 1024 KB
in2.txt WA 59 ms 1024 KB
in3.txt WA 60 ms 1024 KB
in4.txt WA 59 ms 1024 KB
in5.txt WA 24 ms 512 KB
in6.txt WA 39 ms 1024 KB
in7.txt WA 58 ms 1024 KB
in8.txt WA 40 ms 1024 KB
in9.txt WA 8 ms 384 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB