Cod sursa(job #588831)
| Utilizator |  Oncescu Costin geniucos |
Data | 9 mai 2011 19:09:05 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#include<fstream>
using namespace std;
FILE *f,*g;
int n,i;
int main(void)
{f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
int v[n+1];
for (i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
sort(v+1,v+n+1);
for (i=1;i<=n;i++)
fprintf(g,"%d ",v[i]);
fclose(f);
fclose(g);
return 0;
}