Submission #1359159


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
    int N;
    cin >> N;
    vector<ll> S(N);
    REP(i, N) cin >> S[i];
    sort(S.begin(), S.end());
    vector<ll> T(N);
    T[0] = S[0];
    for(int i=1;i<N;i++){
        T[i] = T[i-1]+S[i];
    }
    int i = N-1;
    while(i>0){
        if(S[i]<=2*T[i-1]){
            i--;
        }else{
            break;
        }
    }
    cout << N-i << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Colorful Creatures
User theory_and_me
Language C++14 (GCC 5.4.1)
Score 400
Code Size 671 Byte
Status AC
Exec Time 49 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 19
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 47 ms 1792 KB
in10.txt AC 16 ms 896 KB
in11.txt AC 40 ms 1792 KB
in12.txt AC 49 ms 1792 KB
in13.txt AC 45 ms 1792 KB
in2.txt AC 47 ms 1792 KB
in3.txt AC 47 ms 1792 KB
in4.txt AC 47 ms 1792 KB
in5.txt AC 19 ms 896 KB
in6.txt AC 33 ms 1792 KB
in7.txt AC 47 ms 1792 KB
in8.txt AC 35 ms 1792 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