Cod sursa(job #1254287)
Utilizator | Data | 2 noiembrie 2014 14:49:40 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
#include <algorithm>
FILE *fin, *fout;
int main()
{
fin = fopen("algsort.in", "r");
fout = fopen("algsort.out", "w");
int n;
fscanf(fin, "%d", &n);
int arr[n];
for(int i =0; i< n; i++) fscanf(fin, "%d", &arr[i]);
std::sort(arr, arr+n);
for(int i =0; i< n; i++) fprintf(fout, "%d ", arr[i]);
fprintf(fout, "\n");
return 0;
}