Submission #1521571


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);

        long N = in.nextLong();
        long K = in.nextLong();

        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 300
Code Size 725 Byte
Status AC
Exec Time 567 ms
Memory 61240 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 17
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 92 ms 18640 KB
sample_02.txt AC 93 ms 19796 KB
subtask_1_1.txt AC 120 ms 24276 KB
subtask_1_10.txt AC 536 ms 57340 KB
subtask_1_11.txt AC 567 ms 61240 KB
subtask_1_12.txt AC 537 ms 59336 KB
subtask_1_13.txt AC 502 ms 60996 KB
subtask_1_14.txt AC 517 ms 61104 KB
subtask_1_15.txt AC 536 ms 58908 KB
subtask_1_2.txt AC 174 ms 32232 KB
subtask_1_3.txt AC 361 ms 45424 KB
subtask_1_4.txt AC 464 ms 58128 KB
subtask_1_5.txt AC 551 ms 58936 KB
subtask_1_6.txt AC 96 ms 19668 KB
subtask_1_7.txt AC 121 ms 26068 KB
subtask_1_8.txt AC 205 ms 32904 KB
subtask_1_9.txt AC 386 ms 45748 KB