Cod sursa(job #1679266)
Utilizator | Data | 7 aprilie 2016 20:15:38 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <algorithm>
#define NMax 300000005
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k,x;
int a[NMax];
int main()
{
f >> n >> k;
for(int i = 1; i <= n; ++i)
f >> a[i];
nth_element(a + 1, a + k, a + n + 1);
g << a[k];
return 0;
}