Cod sursa(job #2044176)
Utilizator | Data | 20 octombrie 2017 23:33:34 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fo ut ("sdo.out");
int n, k, v[3000001];
int main()
{
fin >> n >> k;
for (int i=1; i<=n; i++)
fin >> v[i];
nth_element(v+1, v+k, v+n+1);
fout << v[k];
return 0;
}