Submission #1156774
Source Code Expand
#include<iostream> #include<cmath> #include<string.h> #include<stdio.h> #include<algorithm> using namespace std; int n; long long a[100011]; long long s[100011]; int ans; int main() { int i,j,k; int xx; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&xx); a[i]=xx; } sort(a+1,a+n+1); s[0]=0; for(i=1;i<=n;i++) { s[i]=s[i-1]+a[i]; } ans=1; for(i=n-1;i>=1;i--) { if(s[i]*2>=a[i+1]) { ans++; } else { break; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | t3cmax |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 676 Byte |
Status | AC |
Exec Time | 20 ms |
Memory | 1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:16:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:19:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&xx); ^
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 | 19 ms | 1792 KB |
in10.txt | AC | 8 ms | 896 KB |
in11.txt | AC | 18 ms | 1792 KB |
in12.txt | AC | 15 ms | 1792 KB |
in13.txt | AC | 15 ms | 1792 KB |
in2.txt | AC | 19 ms | 1792 KB |
in3.txt | AC | 19 ms | 1792 KB |
in4.txt | AC | 20 ms | 1792 KB |
in5.txt | AC | 8 ms | 896 KB |
in6.txt | AC | 17 ms | 1792 KB |
in7.txt | AC | 19 ms | 1792 KB |
in8.txt | AC | 16 ms | 1792 KB |
in9.txt | AC | 3 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |