Cod sursa(job #397163)
| Utilizator | Data | 16 februarie 2010 15:51:30 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAXN 500010
int v[MAXN];
/*bool comp(int a,int b){
return a < b;
}*/
/*struct comp{
bool operator()(const int &a, const int &b){
return a < b;
}
};*/
int main(){
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%d", &v[i]);
sort(v, v + n);
for(int i = 0; i < n; ++i)
printf("%d ", v[i]);
printf("\n");
return 0;
}