Cod sursa(job #2622890)
Utilizator | Data | 2 iunie 2020 01:08:49 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int NMAX = 3000001;
int v[NMAX], n, k;
int main()
{
f >> n >> k;
for(int i = 0; i < n; i++)
f >> v[i];
nth_element(v, v + k, v + n);
g << v[k - 1];
return 0;
}