Submission #3195708


Source Code Expand

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

#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))

typedef long long LL;

int main(){
  int n;
  cin >> n;
  vector<LL> d(n);
  LL totalg=0,c,g;
  for(int i=0;i<n;i++){
    cin >> c >> g;
    totalg+=g;
    d[i]=g+c;
  }
  sort(d.begin(),d.end());
  int ans=0;
  for(int i=0;i<n;i++){
    totalg-=d[ans];
    if(totalg>=0)  ans=i+1;
    // cout << i << " " << totalg << endl;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task K - パンプキン
User yamunaku
Language C++14 (GCC 5.4.1)
Score 1
Code Size 512 Byte
Status AC
Exec Time 87 ms
Memory 1024 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 1 / 1
Status
AC × 3
AC × 30
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
all sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 2 ms 256 KB
01-10.txt AC 2 ms 256 KB
01-11.txt AC 3 ms 256 KB
01-12.txt AC 5 ms 256 KB
01-13.txt AC 9 ms 384 KB
01-14.txt AC 10 ms 384 KB
01-15.txt AC 21 ms 384 KB
01-16.txt AC 27 ms 512 KB
01-17.txt AC 56 ms 768 KB
01-18.txt AC 86 ms 1024 KB
01-19.txt AC 85 ms 1024 KB
01-20.txt AC 86 ms 1024 KB
01-21.txt AC 85 ms 1024 KB
01-22.txt AC 63 ms 1024 KB
01-23.txt AC 63 ms 1024 KB
01-24.txt AC 87 ms 1024 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB