Cod sursa(job #3313465)
| Utilizator | Data | 4 octombrie 2025 17:29:41 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.26 kb |
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n, k, M[3000001], i;
int main() {
f >> n >> k;
for (i=1;i<=n;++i)
f>>M[i];
sort (M+1,M+n+1);
cout<<M[k];
return 0;
}
