Cod sursa(job #3341878)
| Utilizator | Data | 21 februarie 2026 13:37:26 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NMAX = 3e6 + 1;
int n, k, arr[NMAX];
int main()
{
fin >> n >> k;
for(int i = 1; i <= n; i++)
fin >> arr[i];
nth_element(arr + 1, arr + k, arr + n + 1);
fout << arr[k];
fin.close();
fout.close();
return 0;
}
