Pagini recente » Borderou de evaluare (job #3123332) | Algoritmiada 2010, Clasament Runda Finală, Clasele 9-10 | Cod sursa (job #2813717) | Cod sursa (job #3332888) | Cod sursa (job #2276693)
#include <cstdio>
#include <algorithm>
#define NMAX 500005
using namespace std;
int v[NMAX];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
for(int i = 1 ; i <= n ; i++)
printf("%d ",v[i]);
return 0;
}