Leetcode7.9 前五科的均分

class Solution {
public:
    vector<vector<int>> highFive(vector<vector<int>>& items) {
        vector<int> student[1001];
        for(int i = 0; i < items.size(); i++){
            student[items[i][0]].push_back(items[i][1]);
        }
        vector<vector<int>> result;
        for(int i = 0; i < 1001; i++){
            int a[5] = {0,0,0,0,0};
            for(int j = 0; j <student[i].size(); j++){
                if(student[i][j] > a[0] ) a[0] = student[i][j];
                sort(a,a+5);
            }
            if(a[0] > 0) {
                    vector<int> item = {i,(a[0]+ a[1] + a[2] + a[3] + a[4])/5};
                    result.push_back(item);
            }
            
        }
        return result;
    }
};