Pagini recente » Cod sursa (job #222683) | Cod sursa (job #1590982) | Cod sursa (job #1174542) | Cod sursa (job #3252917) | Cod sursa (job #2664616)
#include <fstream>
#include <cstdlib>
using namespace std;
int numbers[3000002];
void divideetimpera(int left, int right, int k) {
if (left >= right)
return;
int pivot = numbers[left + (rand() % (right - left + 1))];
int aux, i = left - 1, j = right + 1;
while (i <= j) {
do {
++i;
} while (numbers[i] < pivot);
do {
--j;
} while(numbers[j] > pivot);
if (i < j) {
aux = numbers[i];
numbers[i] = numbers[j];
numbers[j] = aux;
}
}
int t = j - left + 1;
if (t >= k)
divideetimpera(left, j, k);
else
divideetimpera(j + 1, right, k-t);
}
int main() {
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k;
in >> n >> k;
for(int i=1; i<=n; ++i)
in >> numbers[i];
divideetimpera(1, n, k);
out << numbers[k];
return 0;
}