Cod sursa(job #1218442)
Utilizator | Data | 11 august 2014 10:47:04 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin( "sdo.in" );
ofstream fout( "sdo.out" );
const int nmax = 3000000;
int v[ nmax ];
int main() {
int n, k;
fin>>n>>k;
for( int i = 0; i < n; ++ i ) {
fin>>v[ i ];
}
-- k;
nth_element( v, v + k, v + n );
fout<<v[ k ]<<'\n';
fin.close();
fout.close();
return 0;
}