|
6 | 6 | importjava.util.PriorityQueue; |
7 | 7 | importjava.util.TreeMap; |
8 | 8 |
|
9 | | -/** |
10 | | - * 1086. High Five |
11 | | - * |
12 | | - * Given a list of scores of different students, return the average score of each student's top five scores in the order of each student's id. |
13 | | - * Each entry items[i] has items[i][0] the student's id, and items[i][1] the student's score. |
14 | | - * The average score is calculated using integer division. |
15 | | - * |
16 | | - * Example 1: |
17 | | - * Input: [[1,91],[1,92],[2,93],[2,97],[1,60],[2,77],[1,65],[1,87],[1,100],[2,100],[2,76]] |
18 | | - * Output: [[1,87],[2,88]] |
19 | | - * Explanation: |
20 | | - * The average of the student with id = 1 is 87. |
21 | | - * The average of the student with id = 2 is 88.6. But with integer division their average converts to 88. |
22 | | - * |
23 | | - * Note: |
24 | | - * 1 <= items.length <= 1000 |
25 | | - * items[i].length == 2 |
26 | | - * The IDs of the students is between 1 to 1000 |
27 | | - * The score of the students is between 1 to 100 |
28 | | - * For each student, there are at least 5 scores |
29 | | - * */ |
30 | 9 | publicclass_1086 { |
31 | 10 | publicstaticclassSolution1 { |
32 | 11 | publicint[][]highFive(int[][]items) { |
|