Pagini recente » Borderou de evaluare (job #939155) | Borderou de evaluare (job #2343617) | Rezultatele filtrării | Borderou de evaluare (job #2173397) | Cod sursa (job #1342383)
#include <cstdio>
#include <algorithm>
using namespace std;
#define IN_FILE "algsort.in"
#define OUT_FILE "algsort.out"
#define MAX_N 500005
int main( ) {
FILE *f;
int N, i;
f = fopen( IN_FILE, "r" );
fscanf( f, "%d", &N );
for( i = 1; i <= N; ++i )
fscanf( f, "%d", v + i );
fclose( f );
sort( v + 1, v + N + 1 );
f = fopen( OUT_FILE, "w" );
for( i = 1; i <= N; ++i )
fprintf( f, "%d ", v[ i ] );
fclose( f );
return 0;
}