Cod sursa(job #643095)
Utilizator | Data | 2 decembrie 2011 22:00:13 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long i, n, k, a[3000010];
int main() {
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin>>n>>k;
for (i = 1; i <= n; ++i) {
fin>>a[i];
}
nth_element(a + 1, a + k, a + n + 1);
fout<<a[k];
return 0;
}