Cod sursa(job #1220057)
Utilizator | Data | 16 august 2014 14:02:50 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
#define NMAX 3000001
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int s[NMAX];
int main() {
int n, k;
f >> n >> k;
for (int i = 0; i < n; ++i) {
f >> s[i];
}
nth_element(s, s + k - 1, s + n);
g << s[k-1] << "\n";
return 0;
}