Pagini recente » Cod sursa (job #1155523) | Cod sursa (job #1020999) | Cod sursa (job #2321735) | Cod sursa (job #2745903) | Cod sursa (job #3139572)
#include <bits/stdc++.h>
using namespace std;
const int N=500010;
const int M=32010;
int p;
char b[M];
inline void inc()
{
p++;
if(p==32000){p=0;fread(b,1,32000,stdin);}
}
inline void read(int &x)
{
while(b[p]<'0'||b[p]>'9')inc();
x=0;
while(b[p]>='0'&&b[p]<='9'){x=10*x+b[p]-'0';inc();}
}
int n,a[N];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
read(n);
for(int i=1;i<=n;i++)
read(a[i]);
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
cout<<a[i]<<' ';
return 0;
}