Cod sursa(job #267307)
| Utilizator | Data | 27 februarie 2009 00:39:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
#include<vector>
#include<algorithm>
#define NMAX 500001
using namespace std;
int n;
vector<int> p;
int main()
{
int i,x;
p.reserve(NMAX);
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
p.push_back(x);
}
sort(p.begin(),p.end());
for(i=0;i<n;i++)
printf("%d ",p[i]);
return 0;
}