Cod sursa(job #395090)
| Utilizator | Data | 12 februarie 2010 08:40:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
#include<algorithm>
#include<stdio.h>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
int i;
long n,v[500000];
int main(){
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%ld",&v[i]);
sort(v+1,v+1+n);
for(i=1;i<=n;i++)
fprintf(g,"%ld ",v[i]);
fclose(f);
fclose(g);
return 0;}