Cod sursa(job #2433637)
Utilizator | skklns mariasmm | Data | 28 iunie 2019 13:58:58 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,k;
f>>n>>k;
int v[n];
for (int i=0; i<n; i++)
{
f>>v[i];
}
nth_element(v, v+k, v+n);
g<<v[k-1];
return 0;
}