1673

class Solution {
public:
    vector<int> mostCompetitive(vector<int>& nums, int k) {
        vector<int> s;
        int sz = nums.size();
        for(int i=0; i<sz; i++){
            while(!s.empty() && s.back() > nums[i] && (s.size()-1+sz-i)>=k)
                s.pop_back();
             if(s.size() < k) s.push_back(nums[i]);
        }
        return s;
    }
};