Submission #4072141


Source Code Expand

#include<cstdio>
#include<bits/stdc++.h>
typedef long long int ll;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR_IN(i, a, b) for(int i = (a); i < (b); i++)
#define BETWEEN(x, a, b) ((x) >= (a) && (x) <= (b))
#define LOG_F 1
#define LOG(...) if(LOG_F) fprintf(stderr, __VA_ARGS__)

using namespace std;

/*
n k
a1 b1
...
an bn
 */
typedef pair<int,int> P;
int n;
ll k;
P p[100000];

int main(){
  cin >> n>>k;
  REP(i,n){
    int a,b;
    cin>>a>>b;
    p[i] = make_pair(a,b);
  }
  sort(p,p+n);

  int ans=0;
  ll j = 0;
  REP(i,n){
    j+=p[i].second;
    if(j>=k){
      ans = p[i].first;
      break;
    }
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Submission Time
Task C - Big Array
User linuxojisan009
Language C++14 (GCC 5.4.1)
Score 300
Code Size 709 Byte
Status AC
Exec Time 84 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_1.txt AC 2 ms 256 KB
subtask_1_10.txt AC 82 ms 1024 KB
subtask_1_11.txt AC 84 ms 1024 KB
subtask_1_12.txt AC 78 ms 1024 KB
subtask_1_13.txt AC 74 ms 1024 KB
subtask_1_14.txt AC 77 ms 1024 KB
subtask_1_15.txt AC 82 ms 1024 KB
subtask_1_2.txt AC 4 ms 256 KB
subtask_1_3.txt AC 26 ms 512 KB
subtask_1_4.txt AC 51 ms 768 KB
subtask_1_5.txt AC 81 ms 1024 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 2 ms 256 KB
subtask_1_8.txt AC 7 ms 256 KB
subtask_1_9.txt AC 36 ms 512 KB