Cod sursa(job #2214267)
Utilizator | Data | 18 iunie 2018 17:27:45 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("sdo.in");
ofstream cout("sdo.out");
int v[3000001];
int main()
{
int n,k,i;
cin >> n >> k;
for(i = 1;i <= n;i++){
cin >> v[i];
}
nth_element(v+1,v+k+1,v+n+1);
cout << v[k];
return 0;
}