Submission #1675870
Source Code Expand
#include <bits/stdc++.h> using namespace std; using VI = vector<int>; using VVI = vector<VI>; using PII = pair<int, int>; using LL = long long; using VL = vector<LL>; using VVL = vector<VL>; using PLL = pair<LL, LL>; using VS = vector<string>; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define FF first #define SS second template<class S, class T> istream& operator>>(istream& is, pair<S,T>& p){ return is >> p.FF >> p.SS; } template<class S, class T> ostream& operator<<(ostream& os, const pair<S,T>& p){ return os << p.FF << " " << p.SS; } template<class T> void maxi(T& x, T y){ if(x < y) x = y; } template<class T> void mini(T& x, T y){ if(x > y) x = y; } const double EPS = 1e-10; const double PI = acos(-1.0); const LL MOD = 1e9+7; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; VL xs(N); REP(i,N) cin >> xs[i]; SORT(xs); VL acc(N+1); REP(i,N) acc[i+1] = acc[i] + xs[i]; int ans = 1; for(int i=N-2;i>=0;--i){ if(acc[i+1]*2 >= xs[i+1]) ++ans; else break; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | okaduki |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1470 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1792 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 | 1792 KB |
in10.txt | AC | 8 ms | 896 KB |
in11.txt | AC | 17 ms | 1792 KB |
in12.txt | AC | 14 ms | 1792 KB |
in13.txt | AC | 14 ms | 1792 KB |
in2.txt | AC | 19 ms | 1792 KB |
in3.txt | AC | 18 ms | 1792 KB |
in4.txt | AC | 18 ms | 1792 KB |
in5.txt | AC | 8 ms | 896 KB |
in6.txt | AC | 15 ms | 1792 KB |
in7.txt | AC | 18 ms | 1792 KB |
in8.txt | AC | 15 ms | 1792 KB |
in9.txt | AC | 3 ms | 512 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |