Submission #2225649
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> struct data_t { int num; int count; bool operator<( const data_t& right ) const { return num < right.num; } }; using namespace std; int main(){ int N,K; long long index = 0; int a,b; data_t d; vector<data_t> list; cin >> N >> K; for(int i=0;i<N;i++){ cin >> a >> b; d.num = a; d.count = b; list.push_back(d); } sort(list.begin(),list.end()); for(int i=0;i<N;i++){ index += list[i].count; if(K <= index){ cout << list[i].num << endl; break; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | yankeiori |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 698 Byte |
Status | WA |
Exec Time | 63 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 | WA | 5 ms | 1400 KB |
subtask_1_11.txt | WA | 5 ms | 1400 KB |
subtask_1_12.txt | WA | 5 ms | 1400 KB |
subtask_1_13.txt | WA | 5 ms | 1400 KB |
subtask_1_14.txt | WA | 5 ms | 1400 KB |
subtask_1_15.txt | WA | 5 ms | 1400 KB |
subtask_1_2.txt | AC | 4 ms | 256 KB |
subtask_1_3.txt | AC | 21 ms | 640 KB |
subtask_1_4.txt | AC | 41 ms | 892 KB |
subtask_1_5.txt | AC | 63 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 | 28 ms | 892 KB |