Cod sursa(job #2622840)
Utilizator | Data | 1 iunie 2020 22:30:39 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{
long n, k, i;
f>>n>>k;
long *v = new long[n];
for(i=0;i<n;i++)
f>>v[i];
nth_element(v,v+k-1,v+n);
g<<v[k-1];
}