Submission #1384009
Source Code Expand
#include <iostream> using namespace std; int main(){ int N,K; int ANUM[100001]={}; cin >>N >>K; for(int i=0; i < N; i++){ int a,b; cin >>a >>b; ANUM[a]+=b; } for(int i=0;i<100001;i++){ if(K<ANUM[i]){ cout<<i<<endl; } K -= ANUM[i]; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | kanipanunu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 360 Byte |
Status | WA |
Exec Time | 160 ms |
Memory | 1152 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 | WA | 155 ms | 1152 KB |
sample_02.txt | WA | 1 ms | 640 KB |
subtask_1_1.txt | WA | 59 ms | 896 KB |
subtask_1_10.txt | WA | 3 ms | 640 KB |
subtask_1_11.txt | WA | 3 ms | 640 KB |
subtask_1_12.txt | WA | 3 ms | 640 KB |
subtask_1_13.txt | WA | 3 ms | 640 KB |
subtask_1_14.txt | WA | 3 ms | 640 KB |
subtask_1_15.txt | WA | 3 ms | 640 KB |
subtask_1_2.txt | WA | 131 ms | 1152 KB |
subtask_1_3.txt | WA | 76 ms | 896 KB |
subtask_1_4.txt | WA | 108 ms | 896 KB |
subtask_1_5.txt | WA | 136 ms | 896 KB |
subtask_1_6.txt | WA | 28 ms | 768 KB |
subtask_1_7.txt | WA | 152 ms | 1152 KB |
subtask_1_8.txt | WA | 160 ms | 1152 KB |
subtask_1_9.txt | WA | 109 ms | 896 KB |