Pagini recente » Cod sursa (job #1201928) | Cod sursa (job #1666001) | Cod sursa (job #658109) | Cod sursa (job #1041412) | Cod sursa (job #1343315)
#include <fstream>
#include <algorithm>
#define DIM 3000011
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int n,p,k;
int v[DIM];
int poz(int st,int dr){
int ii=0,jj=-1;
while(st<dr){
if(v[st]>v[dr]) swap(v[st],v[dr]),swap(ii,jj),ii*=-1,jj*=-1;
st+=ii,dr+=jj;
}
return st;
}
int main(void){
register int i,j;
f>>n>>k;
for(i=1;i<=n;i++) f>>v[i];
/* i=1,j=n;
while(p!=k){
p=poz(i,j);
if(p>k) j=p-1;
else i=p+1;
}*/
nth_element(v+1,v+k,v+n+1);
g<<v[k];
f.close();
g.close();
return 0;
}