Cod sursa(job #2411733)
Utilizator | Data | 21 aprilie 2019 11:00:30 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 3000000
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,sir[NMAX+1],k;
int main(){
f>>n>>k;
for(int i=1;i<=n;i++){
f>>sir[i];
}
nth_element(sir+1,sir+k,sir+n+1);
g<<sir[k];
f.close();
g.close();
}