Cod sursa(job #560380)
Utilizator | Data | 18 martie 2011 14:30:04 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *in=fopen("algsort.in","rt"),*out=fopen("algsort.out","wt");
int n,v[500001];
int main()
{
//ifstream in("algsort.in");
//ofstream out("algsort.out");
//in>>n;
fscanf(in,"%d",&n);
for(int i=1;i<=n;i++)
fscanf(in,"%d",&v[i]);
//in>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<=n;i++)
fprintf(out,"%d ",v[i]);
//out<<v[i]<<" ";
return 0;
}