Submission #2215164
Source Code Expand
// ------------------------------------
// Date:2018/ 3/17
// Problem:C- Big Array b.cpp
//
// ------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << x << endl
typedef long long ll;
void CINT(){}
template <class Head,class... Tail>
void CINT(Head&& head,Tail&&... tail) {
cin >> head; CINT(move(tail)...);
}
#define CIN(...) int __VA_ARGS__;CINT(__VA_ARGS__)
#define LCIN(...) ll __VA_ARGS__;CINT(__VA_ARGS__)
#define SCIN(...) string __VA_ARGS__;CINT(__VA_ARGS__)
static const int MOD = 1000000007;
static const int MAX_N = 1;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
CIN(N, K);
vector< pair< ll, ll > > a(N);
REP(i, N) {
CIN(p, q);
a[i] = make_pair(p, q);
}
sort(ALL(a), [](pair< ll, ll > x, pair< ll, ll > y) { return x.first < y.first; } );
ll ans;
ll cnt = 0;
while (K > 0) {
ans = a[cnt].first;
K -= a[cnt++].second;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Big Array |
User |
task4233 |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1288 Byte |
Status |
WA |
Exec Time |
24 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 |
2 ms |
384 KB |
subtask_1_3.txt |
AC |
8 ms |
768 KB |
subtask_1_4.txt |
AC |
16 ms |
1280 KB |
subtask_1_5.txt |
AC |
24 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 |
3 ms |
384 KB |
subtask_1_9.txt |
AC |
11 ms |
896 KB |