Submission #1357745
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; int N; int Array[100005]; long long Partial[100005]; int Max = 0; void Read() { cin >> N; for(int i = 1; i <= N; i++) { cin >> Array[i]; } sort(Array + 1, Array + N + 1); for(int i = 1; i <= N; i++) { Partial[i] = Partial[i - 1] + Array[i]; if(Partial[i - 1] * 2 < Array[i]) { Max = i; } } cout << N - Max + 1 << "\n"; } int main() { Read(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | alex99 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 546 Byte |
Status | AC |
Exec Time | 61 ms |
Memory | 1408 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 | 60 ms | 1408 KB |
in10.txt | AC | 19 ms | 768 KB |
in11.txt | AC | 50 ms | 1408 KB |
in12.txt | AC | 59 ms | 1408 KB |
in13.txt | AC | 60 ms | 1408 KB |
in2.txt | AC | 59 ms | 1408 KB |
in3.txt | AC | 61 ms | 1408 KB |
in4.txt | AC | 59 ms | 1408 KB |
in5.txt | AC | 24 ms | 640 KB |
in6.txt | AC | 40 ms | 1408 KB |
in7.txt | AC | 60 ms | 1408 KB |
in8.txt | AC | 39 ms | 1408 KB |
in9.txt | AC | 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 |