Cod sursa(job #1216900)
Utilizator | Data | 6 august 2014 01:25:58 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("sdo.in");
ofstream out("sdo.out");
const int nmax = 3000006;
int n, k, v[nmax];
int main(){
int player_unu=0;
in>>n>>k;
for(int i = 1; i<=n; i++)
in>>v[i];
nth_element(v + 1, v + k + 1, v + n + 1);
out<<v[k]<<'\n';
return player_unu;
}