Pagini recente » Borderou de evaluare (job #1849819) | Borderou de evaluare (job #1152101) | Borderou de evaluare (job #1312817) | Cod sursa (job #526501) | Cod sursa (job #959634)
Cod sursa(job #959634)
#include<stdio.h>
#include<algorithm>
using namespace std;
long int n,i,v[500001];
FILE *f,*g;
int main(){
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++){
fscanf(f,"%ld",&v[i]);}
sort(v+1,v+n+1);
for(i=1;i<=n;i++){
fprintf(g,"%ld ",v[i]);}
fclose(f);
fclose(g);
return 0;}