Cod sursa(job #1648398)
| Utilizator | Data | 11 martie 2016 09:53:48 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
ifstream in("sdo.in");
ofstream out ("sdo.out");
int n, k, i, v[300000001];
void read()
{
in >> n >> k;
for(i = 1; i <= n; i ++)
in >> v[i];
}
void solve()
{
nth_element(v+ 1, v + k, v + n + 1);
}
void write()
{
out << v[k];
}
int main()
{
read();
solve();
write();
return 0;
}
