Cod sursa(job #724195)
Utilizator | Data | 26 martie 2012 12:22:46 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <algorithm>
using namespace std;
#define MAXN 3000100
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, k, v[MAXN];
int main () {
int i;
fin >> n >> k;
for (i = 1; i <= n; ++i)
fin >> v[i];
nth_element(v + 1, v + k + 1, v + n + 2);
fout << v[k] << "\n";
fout.close();
return 0;
}