Submission #2225039


Source Code Expand

import java.util.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		long k = Long.parseLong(sc.next());
		int[] a = new int[n];
		long[] d = new long[100001];
		for (int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(sc.next());
			d[a[i]] += Integer.parseInt(sc.next());
		}
		Arrays.sort(a);
		if (k <= d[a[0]]) {
			System.out.println(a[0]);
			return;
		}
		long[] c = new long[n];
		c[0] = d[a[0]];
		for (int i = 1; i < n; i++) {
			if (k - c[i - 1] - d[a[i]] <= 0) {
				System.out.println(a[i]);
				return;
			}
			c[i] = c[i - 1] + d[a[i]];
		}
	}
}

Submission Info

Submission Time
Task C - Big Array
User c_r_5
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 713 Byte
Status WA
Exec Time 493 ms
Memory 51064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 7
WA × 10
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 91 ms 21332 KB
sample_02.txt AC 88 ms 19796 KB
subtask_1_1.txt AC 121 ms 22484 KB
subtask_1_10.txt WA 473 ms 46712 KB
subtask_1_11.txt WA 485 ms 49328 KB
subtask_1_12.txt WA 455 ms 50936 KB
subtask_1_13.txt WA 457 ms 48812 KB
subtask_1_14.txt WA 448 ms 46216 KB
subtask_1_15.txt AC 493 ms 51064 KB
subtask_1_2.txt WA 152 ms 28928 KB
subtask_1_3.txt WA 298 ms 43736 KB
subtask_1_4.txt WA 407 ms 41840 KB
subtask_1_5.txt WA 489 ms 49192 KB
subtask_1_6.txt AC 89 ms 19796 KB
subtask_1_7.txt AC 117 ms 22228 KB
subtask_1_8.txt AC 181 ms 30788 KB
subtask_1_9.txt WA 351 ms 46720 KB