Submission #1770802


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

struct serial_num{
	int number;
	int serial;
};

bool compare(serial_num number1, serial_num number2){
	return number1.number < number2.number;
}

int main(){
	int N, K;
	cin >> N >> K;
	serial_num nums[N];
	for(int i = 0; i < N; i++){
		cin >> nums[i].number;
		cin >> nums[i].serial;
	}
	sort(nums, nums + N, &compare);
	int count = 0;
	for(int i = 0; i < N; i++){
		count += nums[i].serial;
		if(count >= K){
			cout << nums[i].number << endl;
			return 0;
		}
	}
}

Submission Info

Submission Time
Task C - Big Array
User June_boy
Language C++14 (GCC 5.4.1)
Score 0
Code Size 561 Byte
Status WA
Exec Time 80 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 6
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 2 ms 256 KB
subtask_1_10.txt WA 6 ms 1024 KB
subtask_1_11.txt WA 6 ms 1024 KB
subtask_1_12.txt WA 6 ms 1024 KB
subtask_1_13.txt WA 6 ms 1024 KB
subtask_1_14.txt WA 6 ms 1024 KB
subtask_1_15.txt WA 6 ms 1024 KB
subtask_1_2.txt AC 4 ms 256 KB
subtask_1_3.txt AC 26 ms 512 KB
subtask_1_4.txt AC 52 ms 768 KB
subtask_1_5.txt AC 80 ms 1024 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 6 ms 256 KB
subtask_1_9.txt AC 37 ms 640 KB