1
class Solution {
2
 public:
3
  vector<int> kWeakestRows(vector<vector<int>> &mat, int k) {
4
    // <idx, count>
5
    vector<pair<int, int>> freqMapper;
6
    int civilian = 0;
7
    for (int i = 0; i < mat.size(); ++i) {
8
      int degree = count(mat[i].begin(), mat[i].end(), civilian);
9
      freqMapper.push_back({i, degree});
10
    }
11
    sort(freqMapper.begin(), freqMapper.end(), [](pair<int, int> pair1, pair<int, int> pair2) {
12
      if (pair1.second > pair2.second) {
13
        return true;
14
      } else if (pair1.second == pair2.second) {
15
        return pair1.first < pair2.first;
16
      }
17
      return pair1.second > pair2.second;
18
    });
19
    vector<int> kWeakest;
20
    for (int i = 0; i < k; i++) kWeakest.push_back(freqMapper[i].first);
21
    return kWeakest;
22
  }
23
};