Cod sursa(job #3294017)
Utilizator | Data | 15 aprilie 2025 07:49:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include "stdio.h"
#include "algorithm"
#define nmax 500000
using namespace std;
FILE*fin, *fout;
int n, a[nmax];
int main(){
fin = fopen("algsort.in", "r");
fout = fopen("algsort.out", "w");
fscanf(fin, "%d", &n);
for(int i = 0; i < n; ++i)
fscanf(fin, "%d", &a[i]);
sort(a, a+n);
for(int i = 0; i < n; ++i){
fprintf(fout, "%d ", a[i]);
}
}