Submission #2215203
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); long k = sc.nextLong(); int[] a = new int[n]; int[] b = new int[n]; for(int i = 0 ; i < n ; i++) { a[i] = sc.nextInt(); b[i] = sc.nextInt(); } long[] number = new long[100010]; for(int i = 0 ; i < n ; i++) number[a[i]] += b[i]; for(int i = 0 ; i < 100010 ; i++) { k -= number[i]; if(k <= 0) { System.out.println(i); return; } } } }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | kouta1612 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 550 Byte |
Status | AC |
Exec Time | 546 ms |
Memory | 65020 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 94 ms | 17748 KB |
sample_02.txt | AC | 93 ms | 21972 KB |
subtask_1_1.txt | AC | 119 ms | 22356 KB |
subtask_1_10.txt | AC | 542 ms | 62732 KB |
subtask_1_11.txt | AC | 535 ms | 64724 KB |
subtask_1_12.txt | AC | 525 ms | 62716 KB |
subtask_1_13.txt | AC | 518 ms | 61780 KB |
subtask_1_14.txt | AC | 528 ms | 60620 KB |
subtask_1_15.txt | AC | 546 ms | 63832 KB |
subtask_1_2.txt | AC | 181 ms | 32124 KB |
subtask_1_3.txt | AC | 358 ms | 45732 KB |
subtask_1_4.txt | AC | 456 ms | 59904 KB |
subtask_1_5.txt | AC | 537 ms | 65020 KB |
subtask_1_6.txt | AC | 95 ms | 21716 KB |
subtask_1_7.txt | AC | 118 ms | 24916 KB |
subtask_1_8.txt | AC | 216 ms | 38096 KB |
subtask_1_9.txt | AC | 402 ms | 48340 KB |