Submission #4074720
Source Code Expand
// Template #include <iostream> #include <string> #include <vector> #include <utility> #include <functional> #include <numeric> #include <list> #include <set> #include <map> #include <algorithm> #include <cmath> using namespace std; typedef long long ll; #define REP(i, n) for(int i = 0;i < n;i++) #define INF 1 << 30 int MOD = 1000000007; int main(){ std::ios_base::sync_with_stdio(false); int n; cin >> n; std::vector<ll> v(n); REP(i,n) cin >> v[i]; sort(v.begin(),v.end()); ll c = v[0]; int k=0; for(int i=1; i<n; ++i){ if(2*c < v[i]){ k=i; } c+=v[i]; } cout << n-k << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | cacao |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 708 Byte |
Status | AC |
Exec Time | 18 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 | 18 ms | 1024 KB |
in10.txt | AC | 7 ms | 640 KB |
in11.txt | AC | 17 ms | 1024 KB |
in12.txt | AC | 14 ms | 1024 KB |
in13.txt | AC | 13 ms | 1024 KB |
in2.txt | AC | 18 ms | 1024 KB |
in3.txt | AC | 18 ms | 1024 KB |
in4.txt | AC | 18 ms | 1024 KB |
in5.txt | AC | 7 ms | 512 KB |
in6.txt | AC | 15 ms | 1024 KB |
in7.txt | AC | 18 ms | 1024 KB |
in8.txt | AC | 15 ms | 1024 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 |