Cod sursa(job #1566832)
Utilizator | Data | 12 ianuarie 2016 17:49:10 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 3000001
using namespace std;
int n, k;
int v[nmax];
int main()
{
ifstream fi("sdo.in");
ofstream fo("sdo.out");
fi >> n >> k;
for (int i = 0; i < n; i++)
fi >> v[i];
nth_element(v, v+k-1, v+n);
fo << v[k-1] << "\n";
fi.close();
fo.close();
return 0;
}