Submission #1521566
Source Code Expand
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int N = in.nextInt(); long K = in.nextInt(); long B[] = new long[100001]; // 配列を0で満たす Arrays.fill(B,0); for(int cnt = 0;cnt < N; cnt++){ int a = in.nextInt(); int b = in.nextInt(); B[a] += b; } in.close(); for(int cnt = 0; cnt < 100001; cnt++){ if(K <= B[cnt]){ System.out.println(cnt); break; } else{ K -= B[cnt]; } } } }
Submission Info
Submission Time | |
---|---|
Task | C - Big Array |
User | tonaiaki |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 722 Byte |
Status | RE |
Exec Time | 535 ms |
Memory | 63916 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 93 ms | 21844 KB |
sample_02.txt | AC | 94 ms | 19668 KB |
subtask_1_1.txt | AC | 137 ms | 22888 KB |
subtask_1_10.txt | RE | 93 ms | 19796 KB |
subtask_1_11.txt | RE | 96 ms | 21204 KB |
subtask_1_12.txt | RE | 92 ms | 20692 KB |
subtask_1_13.txt | RE | 91 ms | 21844 KB |
subtask_1_14.txt | RE | 101 ms | 21332 KB |
subtask_1_15.txt | RE | 92 ms | 18640 KB |
subtask_1_2.txt | AC | 183 ms | 30008 KB |
subtask_1_3.txt | AC | 371 ms | 44460 KB |
subtask_1_4.txt | AC | 433 ms | 60656 KB |
subtask_1_5.txt | AC | 535 ms | 63916 KB |
subtask_1_6.txt | AC | 97 ms | 21844 KB |
subtask_1_7.txt | AC | 117 ms | 24276 KB |
subtask_1_8.txt | AC | 204 ms | 33172 KB |
subtask_1_9.txt | AC | 401 ms | 48140 KB |