70分求调

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,k;
    cin >> n >> k;
    priority_queue<int,vector<int>,greater<int> > q;
    for (int i=0;i<n;i++){
        int x;
        cin >> x;
        q.push(x);
    }
    for (int i=0;i<k-1;i++){
        int nowd=q.top();
        while (q.top()==nowd) q.pop();
    }
    cout << q.top();
    return 0;
}