Cod sursa(job #1099035)
Utilizator | Data | 5 februarie 2014 14:52:03 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
#define NMAX 500005
using namespace std;
FILE* f=freopen("algsort.in","r",stdin);
FILE* o=freopen("algsort.out","w",stdout);
int n;
int v[NMAX];
bool compare(int a, int b)
{
return a<b;
}
int main()
{
scanf("%d",&n);
for(int i=0;i<n;++i)
scanf("%d",&v[i]);
sort(v,v+n,compare);
for(int i=0;i<n;++i)
printf("%d ",v[i]);
return 0;
}