Cod sursa(job #3142915)
Utilizator | Data | 25 iulie 2023 17:51:41 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
const int nmax = 3000005;
int n, k, A[nmax];
int main()
{
f >> n >> k;
for(int i = 1; i <= n; i ++)
f >> A[i];
sort(A + 1, A + n + 1);
g << A[k];
return 0;
}