PDD笔试-小熊吃糖

代码：

import java.util.Arrays;import java.util.Comparator;import java.util.Scanner;public class Main2 {public static void main(String[] args) {Scanner in = new Scanner(System.in);int n = in.nextInt();int m = in.nextInt();int[] sugur = new int[m];for (int i = 0; i < m; i++) {sugur[i] = in.nextInt();}Bear[] bears = new Bear[n];Bear[] bears2 = new Bear[n];for (int i = 0; i < n; i++) {bears[i] = new Bear();bears[i].Combat = in.nextInt();bears[i].Hunger = in.nextInt();bears2[i] = bears[i];}Arrays.sort(sugur);Arrays.sort(bears, new Comparator<Bear>() {@Overridepublic int compare(Bear o1, Bear o2) {// TODO Auto-generated method stubreturn o2.Combat - o1.Combat;}});boolean[] boo = new boolean[m];for (int i = 0; i < n; i++) {fun(sugur, boo, bears[i]);}for (int i = 0; i < n; i++) {System.out.println(bears2[i].Hunger);}}private static void fun(int[] sugur, boolean[] boo, Bear bear) {for (int i = sugur.length - 1; i >= 0; i--) {if (boo[i] == false) {if (bear.Hunger >= sugur[i]) {bear.Hunger -= sugur[i];boo[i] = true;}}}}}class Bear {int Combat;int Hunger;}