Cod sursa(job #2417282)
Utilizator | Data | 29 aprilie 2019 13:53:55 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in ("sdo.in");
ofstream out ("sdo.out");
int main()
{
ios::sync_with_stdio(false);
int n,x,k;
priority_queue<int> q;
in>>n>>k;
for(int i = 0; i < k; ++i){
in>>x;
q.push(x);
}
for(int i = k; i < n; ++i){
in>>x;
q.push(x);
q.pop();
}
out<<q.top();
return 0;
}