Cod sursa(job #649805)
| Utilizator | Data | 16 decembrie 2011 19:50:35 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
using namespace std;
int compare(const void *a,const void *b)
{
return (*(int*)a - *(int*)b);
}
int main()
{
FILE *f = fopen("algosort.in","r");
FILE *g = fopen("algosort.out","w");
int n, *a;
fscanf(f,"%d", &n);
a = (int*) malloc (n*sizeof(n));
for(int i=0; i<n; i++)
fscanf(f,"%d", &a[i]);
qsort(a,n,sizeof(int),compare);
for(int i=0; i<n; i++)
fprintf(g,"%d ", a[i]);
free(a);
return 0;
}
