Submission #1482852
Source Code Expand
#include <iostream> #include <algorithm> #define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++) using namespace std; typedef long long ll; ll N, A[100000]; int main(void) { cin >> N; REP(i, 0, N) cin >> A[i]; sort(A, A + N, greater<ll>()); ll sum = 0; REP(i, 0, N) sum += A[i]; ll ans = N; REP(i, 0, N) { sum -= A[i]; if(sum * 2 < A[i]) { ans = i + 1; break; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 466 Byte |
Status | AC |
Exec Time | 46 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 | 46 ms | 1024 KB |
in10.txt | AC | 15 ms | 512 KB |
in11.txt | AC | 39 ms | 1024 KB |
in12.txt | AC | 44 ms | 1024 KB |
in13.txt | AC | 44 ms | 1024 KB |
in2.txt | AC | 46 ms | 1024 KB |
in3.txt | AC | 46 ms | 1024 KB |
in4.txt | AC | 46 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 | 32 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 |