Cod sursa(job #1412636)
Utilizator | Data | 1 aprilie 2015 13:24:47 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
#define NMAX 3000001
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int i, n, k, v[NMAX];
int main()
{
f>>n>>k;
for (i=1; i<=n; ++i)
f>>v[i];
nth_element(v+1,v+k,v+n+1);
g<<v[k];
return 0;
}