Pagini recente » Borderou de evaluare (job #1515298) | Cod sursa (job #666239) | Cod sursa (job #443585) | Cod sursa (job #1662387) | Cod sursa (job #570341)
Cod sursa(job #570341)
#include<fstream>
using namespace std;
const int N=500001;
int v[N],aux[N],n;
ifstream in("etc.in");
ofstream out("etc.out");
void sort(int v[],int st,int dr)
{
if (st==dr)
return;
int m=(st+dr)/2,i,j,k;
sort(v,st,m);
sort(v,m+1,dr);
for(k=st,i=st,j=m+1;k<=dr;k++)
if (j>dr || v[i]<v[j] && i<=m)
aux[k]=v[i++];
else
aux[k]=v[j++];
for (k=st;k<=dr;k++)
v[k]=aux[k];
}
int main()
{
int i;
in>>n;
for (i=1;i<=n;i++)
in>>v[i];
sort(v,1,n);
for (i=1;i<=n;i++)
out<<v[i]<<" ";
out<<"\n";
return 0;
}