Submission #2228300


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <limits>
#include <map>
#define REP(i,n) for(long (i)=0;(i)<(n);(i)++)
#define REPI(i,a,b) for(long (i)=(a);(i)<(b);(i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
using namespace std;
using P = pair<long, long>;
using VI = vector<long>;

int main() {
    vector<P> v;
    long n, k;
    cin >> n >> k;
    REP(i,n) {
        long a, b;
        cin >> a >> b;
        v.push_back(P(a,b));
    }
    
    sort(v.begin(), v.end());
    int i = 0;
    long cnt = 0;
    while (cnt < k) {
        cnt += v[i].second;
        i++;
    }
    i--;
    cout << v[i].first << endl;
}

Submission Info

Submission Time
Task C - Big Array
User xuzijian629
Language C++14 (GCC 5.4.1)
Score 300
Code Size 748 Byte
Status AC
Exec Time 67 ms
Memory 2420 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 1 ms 256 KB
subtask_1_10.txt AC 67 ms 2420 KB
subtask_1_11.txt AC 67 ms 2420 KB
subtask_1_12.txt AC 64 ms 2420 KB
subtask_1_13.txt AC 60 ms 2420 KB
subtask_1_14.txt AC 62 ms 2420 KB
subtask_1_15.txt AC 65 ms 2420 KB
subtask_1_2.txt AC 4 ms 384 KB
subtask_1_3.txt AC 22 ms 892 KB
subtask_1_4.txt AC 42 ms 1400 KB
subtask_1_5.txt AC 65 ms 2420 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 5 ms 512 KB
subtask_1_9.txt AC 29 ms 1400 KB