Cod sursa(job #374317)
Utilizator | Data | 16 decembrie 2009 18:11:08 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <cstdio>
#include <algorithm>
#include <fstream>
using namespace std;
#define Nmax 3000005
int i, n, k, x;
int V[Nmax];
int main () {
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
fin >> n >> k;
for (i = 0; i < n; i++)
fin >> V[i];
nth_element (V, V + k - 1, V + n);
fout << V[k-1];
return 0;
}