你说的对但是priority_queue

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