Cod sursa(job #3359538)
| Utilizator | Data | 29 iunie 2026 18:13:56 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main() {
int n, k;
fin >> n >> k;
k--;
vector<int>v(n);
for (int i = 0; i < n; i++) {
fin >> v[i];
}
nth_element(v.begin(), v.begin() + k, v.end());
fout<<v[k]<<'\n';
return 0;
}