Submission #1778047
Source Code Expand
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <complex>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL-1
double EPS=1e-9;
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
typedef complex<double> P;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
long long int MOD = 1000000007;
/*
cin >> n;
vi a(n);
rep(i,n)cin>>a[i];
*/
int n;
bool used[350];
int main(){
int N;
cin>> N;
vector<ll> a(N);
for(int i=0;i<N;i++){
cin>>a[i];
}
sort(a.begin(),a.end());
//a.pb(a[N-1]);
ll now=0;
int ans=0;
for(int i=0;i<N-1;i++){
ll M=a[i+1];
now+=a[i];
if(M>2*now){
ans=i+1;
}
}
cout<<N-ans<<endl;
}
Submission Info
Submission Time |
|
Task |
B - Colorful Creatures |
User |
Ktya_59 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1662 Byte |
Status |
AC |
Exec Time |
47 ms |
Memory |
1024 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
AC |
47 ms |
1024 KB |
in10.txt |
AC |
15 ms |
512 KB |
in11.txt |
AC |
40 ms |
1024 KB |
in12.txt |
AC |
47 ms |
1024 KB |
in13.txt |
AC |
45 ms |
1024 KB |
in2.txt |
AC |
47 ms |
1024 KB |
in3.txt |
AC |
47 ms |
1024 KB |
in4.txt |
AC |
47 ms |
1024 KB |
in5.txt |
AC |
18 ms |
512 KB |
in6.txt |
AC |
33 ms |
1024 KB |
in7.txt |
AC |
46 ms |
1024 KB |
in8.txt |
AC |
33 ms |
1024 KB |
in9.txt |
AC |
7 ms |
384 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |