Cod sursa(job #1971050)
Utilizator | Data | 19 aprilie 2017 19:47:04 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sto.in");
ofstream fout("sto.out");
priority_queue<int,vector<int>,greater<int> >q;
int n,k,aux,cont=1;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;++i)
fin>>aux,q.push(aux);
while(cont!=k)
q.pop(),cont++;
fout<<q.top();
return 0;
}