Cod sursa(job #2628624)
Utilizator | Data | 16 iunie 2020 16:34:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 3000000
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, k, v[NMAX+10];
int main()
{
f >> n >> k;
for(int i=1; i<=n; i++) f >> v[i];
nth_element(v+1, v+k, v+n+1);
g << v[k] << '\n';
return 0;
}