Cod sursa(job #2358314)
Utilizator | Data | 27 februarie 2019 23:38:53 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("sdo.in") ;
ofstream out ("sdo.out") ;
priority_queue < int > q ;
int n , k , i , x ;
int main()
{
in >> n >> k ;
for ( i = 1 ; i <= n ; ++ i )
in >> x , q.push(x) ;
i = 1 ;
while ( i != n - k + 1 ) q.pop() , i ++ ;
out << q.top() ;
}