Pagini recente » Cod sursa (job #1938508) | Cod sursa (job #1925377) | Cod sursa (job #2723737) | Cod sursa (job #1191018) | Cod sursa (job #1345759)
#include<fstream>
using namespace std;
int n, k, i, p;
int v[3000001];
void poz(int st, int dr, int k){
int ii = 0, jj = -1, i = st, j = dr, aux;
while(i < j){
if(v[j] < v[i]){
aux = v[i];
v[i] = v[j];
v[j] = aux;
aux = ii;
ii = -jj;
jj = -aux;
}
i += ii;
j += jj;
}
if(i == k){
p = k;
}
else{
if(i < k){
poz(i + 1, dr, k - i + st);
}
else{
poz(st, i - 1, k);
}
}
}
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int main(){
fin>> n >> k;
for(i = 1; i <= n; i++){
fin>> v[i];
}
poz(1, n, k);
fout<< v[p];
return 0;
}