fork download
copy 
  1. import java.util.*;
  2.  
  3. class Solution {
  4.  
  5.     public static int chef(int num, int c, int[][] arr) {
  6.         boolean[] used = new boolean[num];
  7.         int count = 0;
  8.  
  9.         while (true) {
  10.             int index = -1;
  11.             int minMess = Integer.MAX_VALUE;
  12.  
  13.             for (int i = 0; i < num; i++) {
  14.                 if (!used[i] && arr[i][0] >= c) {
  15.                     if (arr[i][1] < minMess) {
  16.                         minMess = arr[i][1];
  17.                         index = i;
  18.                     }
  19.                 }
  20.             }
  21.  
  22.             if (index == -1) break; // No eligible chef found
  23.  
  24.             used[index] = true;
  25.             c += (arr[index][1] - arr[index][0]); // update complexity
  26.             count++;
  27.         }
  28.  
  29.         return count;
  30.     }
  31.  
  32.     public static void main(String[] args) {
  33.         Scanner sc = new Scanner(System.in);
  34.  
  35.         int num = sc.nextInt(); 
  36.         int c = sc.nextInt(); 
  37.         int[][] arr = new int[num][2];
  38.         for (int i = 0; i < num; i++) {
  39.             arr[i][0] = sc.nextInt(); // Expertise
  40.             arr[i][1] = sc.nextInt(); // Messiness
  41.         }
  42.  
  43.         int result = chef(num, c, arr);
  44.         System.out.println(result);
  45.     }
  46. }
  47.  
Success #stdin #stdout 0.15s 56472KB
comments (?)
stdin
copy 
4
5
5 5
5 5
5 5
5 5
stdout
copy 
4
https://ideone.com/QVCnGa
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!