Cod sursa(job #2194098)
Utilizator | Data | 12 aprilie 2018 11:57:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int NMAX = 3e6 + 5;
int a[NMAX];
int main()
{
int n, k;
f >> n >> k;
for(int i = 1; i <= n; i++)
f >> a[i];
nth_element(a + 1, a + k, a + 1 + n);
g << a[k];
}