Submission #1357744


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int N;
int Array[100005];
int 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 0
Code Size 540 Byte
Status WA
Exec Time 60 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 6
WA × 13
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 WA 59 ms 1024 KB
in10.txt WA 19 ms 512 KB
in11.txt WA 49 ms 1024 KB
in12.txt WA 60 ms 1024 KB
in13.txt WA 59 ms 1024 KB
in2.txt WA 60 ms 1024 KB
in3.txt WA 59 ms 1024 KB
in4.txt WA 60 ms 1024 KB
in5.txt WA 23 ms 512 KB
in6.txt WA 39 ms 1024 KB
in7.txt WA 58 ms 1024 KB
in8.txt WA 40 ms 1024 KB
in9.txt WA 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