1
class Solution {
2
 public:
3
  vector<int> smallestTrimmedNumbers(vector<string> &nums, vector<vector<int>> &queries) {
4
    vector<int> res;
5
    for (auto x : queries) {
6
      priority_queue<pair<string, int>> v;
7
      for (int i = 0; i < nums.size(); i++) {
8
        int t = nums[i].length() - x[1];
9
        string p = nums[i].substr(t, x[1]);
10
        if (v.size() < x[0])
11
          v.push({p, i});
12
        else {
13
          if (v.top().first > p) {
14
            v.pop();
15
            v.push({p, i});
16
          }
17
        }
18
      }
19
      int val = v.top().second;
20
      res.push_back(val);
21
    }
22
    return res;
23
  }
24
};