Submission #1521508
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #define p pair<int, int> using namespace std; int main(){ int n, k, a, b; vector<p> v; cin >> n >> k; for(int i = 0; i < n; i++){ cin >> a >> b; v.push_back(p(a, b)); } sort(v.begin(), v.end()); int i, cnt; i = cnt = 0; while(1){ cnt += v[i].second; if(cnt >= k){ cout << v[i].first << endl; return 0; } i++; } }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | swkfn |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 457 Byte |
Status | RE |
Exec Time | 101 ms |
Memory | 1400 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 | AC | 1 ms | 256 KB |
subtask_1_10.txt | RE | 100 ms | 1400 KB |
subtask_1_11.txt | RE | 100 ms | 1400 KB |
subtask_1_12.txt | RE | 100 ms | 1400 KB |
subtask_1_13.txt | RE | 101 ms | 1400 KB |
subtask_1_14.txt | RE | 101 ms | 1400 KB |
subtask_1_15.txt | RE | 101 ms | 1400 KB |
subtask_1_2.txt | AC | 4 ms | 256 KB |
subtask_1_3.txt | AC | 22 ms | 640 KB |
subtask_1_4.txt | AC | 42 ms | 892 KB |
subtask_1_5.txt | AC | 64 ms | 1400 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 | 384 KB |
subtask_1_9.txt | AC | 29 ms | 892 KB |