Cod sursa(job #1007674)
Utilizator | Data | 9 octombrie 2013 15:33:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
const int N = 3000000;
int v[N];
int main() {
int n, k;
in>>n>>k;
k--;
for (int i = 0; i < n; ++i) {
in>>v[i];
}
nth_element(v, v + k, v + n);
out<< v[k]<< "\n";
return 0;
}