Cod sursa(job #598878)
Utilizator | UAIC Ion Caliman ion_caliman | Data | 27 iunie 2011 14:22:40 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[3000005],n,k,i;
void qs(int left, int right)
{
int i=left, j=right, r=a[(i+j)/2];
while (i<j)
{
while (a[i]<r) i++;
while (r<a[j]) j--;
if (i<=j) swap(a[i],a[j]), i++, j--;
}
if (i==k) g << a[i-1], exit(0);
if (i>k) qs(left,i-2);
if (i<k) qs(i+1,right);
}
int main()
{
f >> n >> k;
for (i=0; i<n; i++)
f >> a[i];
qs(0,n-1);
return 0;
}