Cod sursa(job #1076500)
Utilizator | Data | 10 ianuarie 2014 12:19:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int cmp1(const void *a, const void* b){
if ((int*)a > (int*)b){
return 1;
}
return -1;
}
int V[300000];
int main(){
ifstream f("sdo.in");
ofstream o("sdo.out");
int n = 0, k = 0;
f >> n >> k;
for (int i = 0; i < n; i++){
f >> V[i];
}
sort(V, V + n);
o << V[k - 1];
return 0;
}