Cod sursa(job #3227890)
Utilizator | Tanislav Luca Andrei Pescarus | Data | 3 mai 2024 16:08:42 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("sdo.in");
ofstream g("iesire.out");
const int nmax = 3000005;
int a[nmax];
int n, k;
int main(){
f >> n >> k;
for(int i = 1; i <= n; i++){
f >> a[i];
}
// for(int i = 1; i <= n; i++){
// g << a[i] << ' ';
// }
// g << '\n';
nth_element(a + 1, a + k, a + n + 1);
g << a[k];
// for(int i = 1; i <= n; i++){
// g << a[i] << ' ';
// }
}