Pagini recente » Cod sursa (job #377883) | Cod sursa (job #2625764) | Cod sursa (job #2084725) | Cod sursa (job #1441687) | Cod sursa (job #2216144)
#include<cstdio>
#include<cstdlib>
#include<ctime>
#define MAX_N 3000000
using namespace std;
int v[MAX_N], n, k;
int nthElement(int k, int n) {
srand(time(NULL));
int Begin, End, b, e, tmp, pivot;
Begin = 0;
End = n - 1;
while(Begin < End) {
b = Begin;
e = End;
pivot = v[Begin+rand()%(End-Begin+1)];
while(b <= e) {
while(v[b] < pivot) b++;
while(v[e] > pivot) e--;
if(b <= e) {
tmp = v[b];
v[b] = v[e];
v[e] = tmp;
b++;
e--;
}
}
if(k <= e)
End = e;
else if(k >= b)
Begin = b;
else Begin = End = k;
}
return v[k];
}
int main() {
FILE* fin, *fout;
fin = fopen("sdo.in","r");
fout = fopen("sdo.out","w");
fscanf(fin,"%d%d",&n,&k);
for(int i = 0; i < n; i++)
fscanf(fin,"%d",&v[i]);
fprintf(fout,"%d\n",nthElement(k-1,n));
fclose(fin);
fclose(fout);
return 0;
}