Submission #11356560


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int main() {
  int n, k;
  cin >> n >> k;
  vector<P> vec;
  rep(i,n) cin >> vec[i].first >> vec[i].second;
  sort(vec.begin(),vec.end());
  int cnt = 0;
  rep(i,n) {
    cnt += vec[i].second;
    if(cnt>=k) {
      cout << vec[i].first << endl;
      return 0;
    }
  }
}

Submission Info

Submission Time
Task C - Big Array
User ahoge_erio
Language C++14 (GCC 5.4.1)
Score 0
Code Size 571 Byte
Status RE
Exec Time 99 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 2
RE × 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 RE 97 ms 256 KB
sample_02.txt RE 96 ms 256 KB
subtask_1_1.txt RE 96 ms 256 KB
subtask_1_10.txt RE 98 ms 256 KB
subtask_1_11.txt RE 98 ms 256 KB
subtask_1_12.txt RE 98 ms 256 KB
subtask_1_13.txt RE 99 ms 256 KB
subtask_1_14.txt RE 98 ms 256 KB
subtask_1_15.txt RE 98 ms 256 KB
subtask_1_2.txt RE 96 ms 256 KB
subtask_1_3.txt RE 97 ms 256 KB
subtask_1_4.txt RE 96 ms 256 KB
subtask_1_5.txt RE 97 ms 256 KB
subtask_1_6.txt RE 96 ms 256 KB
subtask_1_7.txt RE 97 ms 256 KB
subtask_1_8.txt RE 97 ms 256 KB
subtask_1_9.txt RE 98 ms 256 KB