Submission #1521547


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();
        int K = in.nextInt();

        long B[] = new long[100010];

        // 配列を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 721 Byte
Status RE
Exec Time 542 ms
Memory 64792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
RE × 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 95 ms 16980 KB
sample_02.txt AC 95 ms 21844 KB
subtask_1_1.txt AC 139 ms 24916 KB
subtask_1_10.txt RE 94 ms 21844 KB
subtask_1_11.txt RE 92 ms 19924 KB
subtask_1_12.txt RE 94 ms 21588 KB
subtask_1_13.txt RE 100 ms 19924 KB
subtask_1_14.txt RE 103 ms 21716 KB
subtask_1_15.txt RE 94 ms 23764 KB
subtask_1_2.txt AC 189 ms 31832 KB
subtask_1_3.txt AC 366 ms 48736 KB
subtask_1_4.txt AC 468 ms 59556 KB
subtask_1_5.txt AC 542 ms 64792 KB
subtask_1_6.txt AC 111 ms 19412 KB
subtask_1_7.txt AC 118 ms 21072 KB
subtask_1_8.txt AC 215 ms 37284 KB
subtask_1_9.txt AC 384 ms 49444 KB