Submission #1846867


Source Code Expand

#include <cstdio>
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
 
using namespace std;
using ll = long long;
 
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
 
int main()
{
	ll n, k, a, b, i, m = 0;
	pair<ll, ll> p[100001];

	cin >> n >> k;
	for(i = 0; i < n; i++){
		cin >> a >> b;
		p[i] = make_pair(a, b);
	}

	sort(p, p + n);

	for(i = 0; i < n; i++){
		m += p[i].second;
		if(m >= k){
			break;
		}
	}

	cout << p[i].first << endl;
}

Submission Info

Submission Time
Task C - Big Array
User chocobo
Language C++14 (GCC 5.4.1)
Score 300
Code Size 682 Byte
Status AC
Exec Time 66 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 17
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 2 ms 1792 KB
sample_02.txt AC 2 ms 1792 KB
subtask_1_1.txt AC 2 ms 1792 KB
subtask_1_10.txt AC 66 ms 1792 KB
subtask_1_11.txt AC 66 ms 1792 KB
subtask_1_12.txt AC 62 ms 1792 KB
subtask_1_13.txt AC 58 ms 1792 KB
subtask_1_14.txt AC 60 ms 1792 KB
subtask_1_15.txt AC 64 ms 1792 KB
subtask_1_2.txt AC 4 ms 1792 KB
subtask_1_3.txt AC 22 ms 1792 KB
subtask_1_4.txt AC 41 ms 1792 KB
subtask_1_5.txt AC 63 ms 1792 KB
subtask_1_6.txt AC 2 ms 1792 KB
subtask_1_7.txt AC 2 ms 1792 KB
subtask_1_8.txt AC 6 ms 1792 KB
subtask_1_9.txt AC 29 ms 1792 KB