Cod sursa(job #2556811)
Utilizator | Data | 25 februarie 2020 10:43:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long long int v[400005],k,n;
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
nth_element(v,v+k+1,v+n+1);
g<<v[k];
return 0;
}