Cod sursa(job #2097097)
Utilizator | Data | 30 decembrie 2017 15:21:20 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n , k , v[3000001] , i ;
int main()
{
f >> n >> k;
for ( i = 1 ; i <= n ; i ++ )
f >> v[ i ] ;
nth_element( v + 1 , v + k , v + n + 1) ;
g << v [ k ] ;
return 0;
}