Cod sursa(job #899757)
Utilizator | Data | 28 februarie 2013 16:11:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
FILE*in=fopen("algsort.in","r");
FILE*out=fopen("algsort.out","w");
int nr,v[500001];
int main()
{
fscanf(in,"%d",&nr);
for(int i=1;i<=nr;++i)
fscanf(in,"%d",&v[i]);
sort(v+1,v+nr+1);
for(int i=1;i<=nr;++i)
fprintf(out,"%d ",&v[i]);
fclose(in);
fclose(out);
return 0;
}