Cod sursa(job #1019730)
| Utilizator | Data | 31 octombrie 2013 20:54:28 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include<iostream>
#include<fstream>
using namespace std;
void quicksort(int v[3000000],int s,int d)
{
int i=s,j=d;
int aux;
int pivot=v[(s+d)/2];
while(i<=j)
{while (v[i]<pivot)
i++;
while(v[j]>pivot)
j--;
if (i<=j)
{aux=v[i];
v[i]=v[j];
v[j]=aux;
i++;
j--;
}
}
if (s<j)
quicksort(v,s,j);
if (i<d)
quicksort(v,i,d);
}
int main()
{
int v[3000000],i,n,k;
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
quicksort(v,1,n);
g<<v[k];
}
