题解 | #第k轻的牛牛#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param weights int整型vector 
     * @param k int整型 
     * @return int整型
     */
    int findKthSmallest(vector<int>& weights, int k) {
        // write code here
        priority_queue<int, vector<int>, less<int>> q;
        for (int i = 0; i < weights.size(); i++) {
            if (q.size() < k) {
                q.push(weights[i]);
            } else if (q.top() > weights[i]) {
                q.pop();
                q.push(weights[i]);
            }
        }
        return q.top();
    }
};