Submission #1156761
Source Code Expand
#include <set> #include <map> #include <queue> #include <ctime> #include <cmath> #include <cstdio> #include <vector> #include <string> #include <cctype> #include <bitset> #include <cstring> #include <cstdlib> #include <utility> #include <iostream> #include <algorithm> #define REP(i,a,b) for(int i=(a);i<=(b);i++) #define PER(i,a,b) for(int i=(a);i>=(b);i--) #define RVC(i,S) for(int i=0;i<(S).size();i++) #define RAL(i,u) for(int i=fr[u];i!=-1;i=e[i].next) using namespace std; typedef long long LL; typedef pair<int,int> pii; template<class T> inline void read(T& num) { bool start=false,neg=false; char c; num=0; while((c=getchar())!=EOF) { if(c=='-') start=neg=true; else if(c>='0' && c<='9') { start=true; num=num*10+c-'0'; } else if(start) break; } if(neg) num=-num; } /*============ Header Template ============*/ const int maxn=(int)(1e5)+5; int ai[maxn]; int n; inline int chk(int ps) { LL tot=ai[ps]; REP(i,1,n) if(i!=ps) { if(ai[i]<=2*tot) tot+=ai[i]; else return 0; } return 1; } int main() { read(n); REP(i,1,n) read(ai[i]); sort(ai+1,ai+n+1); int l=1,r=n; while(l<r) { int mid=(l+r)>>1; if(chk(mid)) r=mid; else l=mid+1; } printf("%d\n",n-l+1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | frank_c1 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1393 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 640 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 | 17 ms | 640 KB |
in10.txt | AC | 6 ms | 384 KB |
in11.txt | AC | 15 ms | 640 KB |
in12.txt | AC | 13 ms | 640 KB |
in13.txt | AC | 12 ms | 640 KB |
in2.txt | AC | 17 ms | 640 KB |
in3.txt | AC | 17 ms | 640 KB |
in4.txt | AC | 17 ms | 640 KB |
in5.txt | AC | 7 ms | 384 KB |
in6.txt | AC | 13 ms | 640 KB |
in7.txt | AC | 16 ms | 640 KB |
in8.txt | AC | 13 ms | 640 KB |
in9.txt | AC | 3 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |