Cod sursa(job #1741375)
Utilizator | Data | 13 august 2016 19:28:19 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, k;
int m[3000001];
int i;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main()
{
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> m[i];
fin.close();
nth_element(m + 1, m + k, m + n + 1);
fout << m[k];
}