Eliminate Maximum Number of Monsters LeetCode solution in C++

1
class Solution {
2
 public:
3
  int eliminateMaximum(vector<int> &dist, vector<int> &speed) {
4
    priority_queue<double, vector<double>, greater<double>> pq;
5

6
    for (int i = 0; i < dist.size(); ++i) pq.push(ceil((double)dist[i] / speed[i]));
7

8
    int t = 0;
9
    while (pq.size() && pq.top() > t++) pq.pop();
10
    return dist.size() - pq.size();
11
  }
12
};