Cod sursa(job #994737)
Utilizator | Data | 6 septembrie 2013 10:35:28 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int i,j,k,l,m,n;
int a[500000];
FILE *fin,*fout;
int main()
{
fin=fopen("algsort.in","r");
fscanf(fin,"%d",&n);
for (i=0; i<n; i++) fscanf(fin,"%d",&a[i]);
sort(a,a+n);
fout=fopen("algsort.out","w");
for (i=0; i<n; i++)
fprintf(fout,"%d ",a[i]);
}