Pagini recente » Borderou de evaluare (job #2488459) | Borderou de evaluare (job #1655578) | Borderou de evaluare (job #2527584) | Borderou de evaluare (job #1112726) | Cod sursa (job #590855)
Cod sursa(job #590855)
#include<stdio.h>
#include<algorithm>
using namespace std;
int n,x[500001];
int main() {
int i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&x[i]);
sort(&x[1],&x[n+1]);
for(i=1;i<=n;++i)
printf("%d ",x[i]);
return 0;
}