Cod sursa(job #3312263)
| Utilizator | Data | 27 septembrie 2025 11:31:18 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include <algorithm>
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main() {
int n, k, i, v[4000003];
fin >> n >> k;
for (i = 0; i < n; i++)
fin >> v[i];
sort(v, v + n);
fout<<v[k-1];
return 0;
}