Pagini recente » Borderou de evaluare (job #1159058) | Borderou de evaluare (job #1117394) | Borderou de evaluare (job #1160257) | Borderou de evaluare (job #1164805) | Cod sursa (job #1150776)
#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
ofstream fout("algsort.out");
int n,i,a[500001];
bool comp(int a,int b)
{
return a<b;
}
int main()
{
freopen("algsort.in","r",stdin);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1,comp);
for(i=1;i<=n;i++)
fout<<a[i]<<" ";
return 0;
}