Pagini recente » Cod sursa (job #3150406) | Cod sursa (job #1489397) | Cod sursa (job #1304779) | Cod sursa (job #1342615) | Cod sursa (job #1453090)
#include <cstdio>
#include <queue>
using namespace std;
FILE *fin = fopen("sdo.in","r");
FILE *fout = fopen("sdo.out","w");
priority_queue <int> MyQue;
int N, K, x;
int main() {
fscanf(fin, "%d %d\n", &N, &K);
for(int i = 1; i <= N; ++i) {
fscanf(fin, "%d", &x);
MyQue.push(x);
}
while(N >= K) {
++K;
x = MyQue.top();
//cout << x << '\n';
MyQue.pop();
}
fprintf(fout, "%d\n", x);
fclose(fin);
fclose(fout);
return 0;
}