Submission #1157285


Source Code Expand

#include<bits/stdc++.h>

using namespace std;

struct UnionFind
{
  vector< int > data;

  UnionFind(int sz)
  {
    data.assign(sz, -1);
  }

  bool unite(int x, int y)
  {
    x = find(x), y = find(y);
    if(x == y) return (false);
    swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return (true);
  }

  int find(int k)
  {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }

  int size(int k)
  {
    return (-data[find(k)]);
  }
};

// A[i]*2 ≧ A[j]

int main()
{
  int N, A[100000];

  cin >> N;
  for(int i = 0; i < N; i++) {
    cin >> A[i];
  }

  sort(A, A + N);

  int last = 0;
  long long sum = 0;
  for(int i = 0; i < N; i++) {
    if(A[i] > sum * 2) {
      last = i;
    }
    sum += A[i];
  }

  cout << N - last << endl;


}

Submission Info

Submission Time
Task B - Colorful Creatures
User ei13333
Language C++14 (GCC 5.4.1)
Score 400
Code Size 838 Byte
Status AC
Exec Time 60 ms
Memory 640 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 59 ms 640 KB
in10.txt AC 19 ms 384 KB
in11.txt AC 50 ms 640 KB
in12.txt AC 59 ms 640 KB
in13.txt AC 60 ms 640 KB
in2.txt AC 59 ms 640 KB
in3.txt AC 60 ms 640 KB
in4.txt AC 59 ms 640 KB
in5.txt AC 24 ms 384 KB
in6.txt AC 39 ms 640 KB
in7.txt AC 59 ms 640 KB
in8.txt AC 39 ms 640 KB
in9.txt AC 8 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB