Submission #1289061
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(int i = 0; i < (n); i++) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; typedef pair<int, int> P; int n; ll k; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin >> n >> k; ll sum = 0, flag = -1; FOR(i, n) { ll a, b; cin >> a >> b; sum += b; if (flag == -1 && k <= sum) flag = a; } cout << flag << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | moguta |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 556 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
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 | WA | 1 ms | 256 KB |
subtask_1_10.txt | WA | 17 ms | 256 KB |
subtask_1_11.txt | WA | 17 ms | 256 KB |
subtask_1_12.txt | WA | 16 ms | 256 KB |
subtask_1_13.txt | WA | 16 ms | 256 KB |
subtask_1_14.txt | WA | 17 ms | 256 KB |
subtask_1_15.txt | AC | 17 ms | 256 KB |
subtask_1_2.txt | WA | 2 ms | 256 KB |
subtask_1_3.txt | WA | 6 ms | 256 KB |
subtask_1_4.txt | WA | 11 ms | 256 KB |
subtask_1_5.txt | WA | 16 ms | 256 KB |
subtask_1_6.txt | WA | 1 ms | 256 KB |
subtask_1_7.txt | WA | 1 ms | 256 KB |
subtask_1_8.txt | WA | 2 ms | 256 KB |
subtask_1_9.txt | WA | 8 ms | 256 KB |