fork(1) download
copy 
  1. import java.util.*;
  2.  
  3. class Solution
  4.   {
  5.     public static int chef(int num, int c, int[][] arr) 
  6.     {
  7.         Arrays.sort(arr, (a, b) -> Integer.compare(a[0], b[0]));
  8.  
  9.         int count = 0;
  10.         for (int i = 0; i < num; i++) {
  11.             int e = arr[i][0];
  12.             int m = arr[i][1];
  13.  
  14.             if (e >= c) {
  15.                 count++;
  16.                 c += (m - e);
  17.             }
  18.         }
  19.         return count;
  20.     }
  21.  
  22.     public static void main(String[] args) {
  23.         Scanner sc = new Scanner(System.in);
  24.  
  25.         int num = sc.nextInt(); 
  26.         int c = sc.nextInt(); 
  27.         int[][] arr = new int[num][2];
  28.         for (int i = 0; i < num; i++) 
  29.         {
  30.             arr[i][0] = sc.nextInt(); 
  31.             arr[i][1] = sc.nextInt(); 
  32.         }
  33.  
  34.         int result = chef(num, c, arr);
  35.         System.out.println(result);
  36.     }
  37. }
  38.  
Success #stdin #stdout 0.14s 54424KB
comments (?)
stdin
copy 
4
5
5 5
5 5
5 5
5 5
stdout
copy 
4
https://ideone.com/DgsmKT
language:
Java (HotSpot 12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!