Cod sursa(job #1454335)
Utilizator | Data | 26 iunie 2015 09:27:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
const int NMAX = 3000000;
int v[NMAX+2], N, K;
int main()
{
in >> N >> K;
for( int i = 1; i <= N; ++i ) in >> v[i];
nth_element( v+1, v+K, v+N+1 );
out << v[K] << '\n';
return 0;
}