Cod sursa(job #2631215)
Utilizator | Data | 29 iunie 2020 14:29:21 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
long long n,k,v[3000000];
int main()
{
in>>n>>k;
for ( int i=1; i<=n; i++)
in>>v[i];
nth_element(v+1, v+k, v+n+1);
out<<v[k];
return 0;
}