Submission #2227330
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <algorithm> #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) using namespace std; typedef long long int lli; typedef pair<lli, lli> P; const int MAX = 1e5; int main() { int N, K; cin >> N >> K; vector<P> a(N); rep(i, N) { int s, t; cin >> s >> t; a[i]=make_pair(s,t); } sort(a.begin(), a.end()); int sum = 0; rep(i, N) { sum += a[i].second; if (K <= sum) { cout << a[i].first; break; } } }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | spawn |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 561 Byte |
Status | WA |
Exec Time | 64 ms |
Memory | 1792 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 | 1792 KB |
subtask_1_11.txt | WA | 5 ms | 1792 KB |
subtask_1_12.txt | WA | 5 ms | 1792 KB |
subtask_1_13.txt | WA | 5 ms | 1792 KB |
subtask_1_14.txt | WA | 5 ms | 1792 KB |
subtask_1_15.txt | WA | 5 ms | 1792 KB |
subtask_1_2.txt | AC | 4 ms | 256 KB |
subtask_1_3.txt | AC | 22 ms | 768 KB |
subtask_1_4.txt | AC | 42 ms | 1280 KB |
subtask_1_5.txt | AC | 64 ms | 1792 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 | 896 KB |