Find the Most Competitive Subsequence LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> mostCompetitive(vector<int> &nums, int k) {
4
    vector<int> stack;
5
    int nums_to_delete = nums.size() - k;
6
    for (int i = 0; i < nums.size(); i++) {
7
      while (!stack.empty() && nums[i] < stack.back() && nums_to_delete) {
8
        stack.pop_back();
9
        nums_to_delete--;
10
      }
11
      stack.push_back(nums[i]);
12
    }
13
    return vector<int>(stack.begin(), stack.begin() + k);
14
  }
15
};