Submission #2695904


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

int solve(int N,ll K,vi& a,vi& b) {
    vector<ii> ab(N);
    rep(i,N) ab[i] = ii(a[i], b[i]);
    sort(ALL(ab));
    vector<ll> ac(N+1);
    ac[0] = 0;
    rep(i,N) ac[i+1] = ac[i] + ab[i].second;
#ifdef DEBUG
    cerr << ab << endl;
    cerr << ac << endl;
#endif
    int ix = upper_bound(ALL(ac), K-1) - ac.begin() - 1;
    // cerr << "ix=" << ix << endl;
    return ab[ix].first;
}

int main() {
    int n; ll k; cin>>n>>k;
    vi a(n), b(n);
    rep(i,n) cin>>a[i]>>b[i];
    cout << solve(n,k,a,b) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Big Array
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2290 Byte
Status
Exec Time 68 ms
Memory 2560 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt
All 300 / 300 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 1 ms 256 KB
sample_02.txt 1 ms 256 KB
subtask_1_1.txt 1 ms 256 KB
subtask_1_10.txt 67 ms 2560 KB
subtask_1_11.txt 68 ms 2560 KB
subtask_1_12.txt 64 ms 2560 KB
subtask_1_13.txt 60 ms 2560 KB
subtask_1_14.txt 61 ms 2560 KB
subtask_1_15.txt 65 ms 2560 KB
subtask_1_2.txt 4 ms 384 KB
subtask_1_3.txt 22 ms 1024 KB
subtask_1_4.txt 42 ms 1792 KB
subtask_1_5.txt 65 ms 2560 KB
subtask_1_6.txt 1 ms 256 KB
subtask_1_7.txt 1 ms 256 KB
subtask_1_8.txt 5 ms 384 KB
subtask_1_9.txt 29 ms 1280 KB