leetcode

0 class Solution {

1 public:

2 vector<int> findingUsersActiveMinutes(vector<vector<int>> &logs, int k) {

3 sort(logs.begin(), logs.end());

4

5 vector<int> res(k, 0);

6 int crnt = logs.front()[0], val = logs.front()[1], count = 1;

7 for (const auto &log : logs) {

8 if (log[0] == crnt) {

9 if (log[1] == val) continue;

10 val = log[1];

11 count++;

12 } else {

13 if (count >= 1 && count <= k) res[count - 1]++;

14 crnt = log[0];

15 val = log[1];

16 count = 1;

17 }

18 }

19 if (count >= 1 && count <= k) res[count - 1]++;

20 return res;

21 }

22 };