Cod sursa(job #2913360)
Utilizator | Data | 14 iulie 2022 00:34:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main()
{
int n, k;
fin >> n >> k;
int M[n];
for (int i = 0; i<n; i++){
fin >> M[i];
}
sort(M, M+n);
fout << M[k-1];
return 0;
}