Submission #2214401
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef pair<ll,ll> pi; #define inf 1000000007 #define rep(i,a,b) for (int i = a; i <= b; i++) #define f first #define s second #define pb push_back #define mp make_pair #define mt make_tuple vector<pi> v; ll n, k, a, b, ans=0; int main(){ cin >> n >> k; rep(i, 0, n-1){ cin >> a >> b; v.pb({a,b}); } sort(v.begin(), v.end()); rep(i, 0, n-1){ ans+=v[i].s; if(k<=ans){cout << v[i].f ;break;} } return 0;}
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | KazukiMH |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 533 Byte |
Status | AC |
Exec Time | 67 ms |
Memory | 2420 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | AC | 67 ms | 2420 KB |
subtask_1_11.txt | AC | 67 ms | 2420 KB |
subtask_1_12.txt | AC | 63 ms | 2420 KB |
subtask_1_13.txt | AC | 59 ms | 2420 KB |
subtask_1_14.txt | AC | 61 ms | 2420 KB |
subtask_1_15.txt | AC | 66 ms | 2420 KB |
subtask_1_2.txt | AC | 4 ms | 384 KB |
subtask_1_3.txt | AC | 21 ms | 892 KB |
subtask_1_4.txt | AC | 42 ms | 1400 KB |
subtask_1_5.txt | AC | 64 ms | 2420 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 | 512 KB |
subtask_1_9.txt | AC | 29 ms | 1400 KB |