Submission #2210574
Source Code Expand
#include <iostream> #include <map> using namespace std; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N, K, a, b; cin >> N >> K; map<int, int> mp; for (int i=0; i<N; ++i){ cin >> a >> b; if(mp.count(a) == 0){ mp[a] = b; } else{ mp[a] += b; } } int count = 0; for (auto itr = mp.begin(); itr != mp.end(); ++itr){ count += itr->second; if (count >= K){ cout << itr->first << "\n"; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | ryucoder |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 617 Byte |
Status | WA |
Exec Time | 50 ms |
Memory | 3200 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 | WA | 3 ms | 256 KB |
subtask_1_11.txt | WA | 3 ms | 256 KB |
subtask_1_12.txt | WA | 3 ms | 256 KB |
subtask_1_13.txt | WA | 3 ms | 256 KB |
subtask_1_14.txt | WA | 3 ms | 256 KB |
subtask_1_15.txt | WA | 3 ms | 256 KB |
subtask_1_2.txt | AC | 3 ms | 512 KB |
subtask_1_3.txt | AC | 17 ms | 1536 KB |
subtask_1_4.txt | AC | 33 ms | 2560 KB |
subtask_1_5.txt | AC | 50 ms | 3200 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |
subtask_1_8.txt | AC | 4 ms | 512 KB |
subtask_1_9.txt | AC | 21 ms | 1920 KB |