Cod sursa(job #429221)
| Utilizator | Data | 29 martie 2010 22:38:12 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<long> v;
long n, i, aux;
freopen("algsort.in", "rt", stdin);
scanf("%ld", &n);
v.push_back(0);
for(i=1; i<=n; i++)
{
scanf("%ld", &aux);
v.push_back(aux);
}
sort(v.begin(), v.end());
freopen("algsort.out", "wt", stdout);
for(i=1; i<=n; i++)
printf("%ld ", v[i]);
return 0;
}