Cod sursa(job #1124535)
| Utilizator | Data | 26 februarie 2014 12:38:27 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
#include<algorithm>
long n,i;
int main()
{
FILE *f1,*f2;
f1=fopen("algsort.in","r");
f2=fopen("algsort.out","w");
fscanf(f1,"%ld",&n);
long long v[n];
for(i=0;i<n;i++)
fscanf(f1,"%lld",&v[i]);
std::sort(v,v+n);
for(i=0;i<n;i++)
fprintf(f2,"%lld",v[i]);
}
