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