Cod sursa(job #2969452)
Utilizator | Data | 23 ianuarie 2023 01:25:08 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 3000005
ifstream in("sdo.in");
ofstream out("sdo.out");
int N, x, k;
int V[MAX_N];
void Read() {
in >> N >> k;
for (int i = 1; i <= N; ++i) {
in >> V[i];
}
}
void Solve() {
nth_element(V+1, V+k, V+N+1);
out << V[k] << '\n';
}
int main() {
Read();
Solve();
return 0;
}