Submission #2408924


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <string>
#include <utility>
#include <map>
#include <queue>
#include <list>
int dx[4]={-1,0,1,0};
int dy[4]={0,1,0,-1};
#define INF 1<<21
using pii = std::pair<int,int>;
#define SORT(v) std::sort(v.begin(), v.end())
int main(){
    int N, K;
    long long count = 0;
    std::cin >> N >> K;
    std::vector<pii> a(N+1);
    a[0].first = a[0].second = 0;
    for (int i = 1; i <= N; i++) {
        std::cin >> a[i].first >> a[i].second;
    }
    SORT(a);
    for (int i = 1; i <= N; i++) {
        
        int b = a[i].second;
        K -= b;
        if (K<=0) {
            std::cout << a[i].first << std::endl;
            return 0;
        }
    }
    return 0;
}

Submission Info

Submission Time
Task C - Big Array
User kz_0420
Language C++14 (GCC 5.4.1)
Score 0
Code Size 859 Byte
Status WA
Exec Time 64 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 6
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 WA 5 ms 1024 KB
subtask_1_11.txt WA 5 ms 1024 KB
subtask_1_12.txt WA 5 ms 1024 KB
subtask_1_13.txt WA 5 ms 1024 KB
subtask_1_14.txt WA 5 ms 1024 KB
subtask_1_15.txt WA 5 ms 1024 KB
subtask_1_2.txt AC 4 ms 256 KB
subtask_1_3.txt AC 21 ms 512 KB
subtask_1_4.txt AC 42 ms 768 KB
subtask_1_5.txt AC 64 ms 1024 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 256 KB
subtask_1_9.txt AC 28 ms 512 KB