Cod sursa(job #2833866)
Utilizator | Data | 15 ianuarie 2022 20:10:53 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
const int MAX_N = 3e6+5;
int v[MAX_N];
int n, k;
int main (){
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>v[i];
nth_element(v+1, v+k+1, v+n+1);
fout<<v[k];
return 0;
}