Cod sursa(job #1019871)
Utilizator | Data | 1 noiembrie 2013 01:25:35 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int n,
v[5000001],
k;
int main() {
ifstream f("sdo.in");
ofstream g("sdo.out");
f >> n >> k;
for(int i = 1; i <= n; i++)
f >> v[i];
nth_element(v + 1, v + k, v + n + 1);
g << v[k];
return 0;
}