Cod sursa(job #1010306)
| Utilizator | Data | 14 octombrie 2013 18:25:15 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX_N 500000
int n, v[MAX_N];
void read( FILE *fin ) {
fscanf( fin, "%d", &n );
for ( int i = 0; i < n; ++i )
fscanf( fin, "%d", &v[i] );
}
void write( FILE *fout ) {
for ( int i = 0; i < n; ++i )
fprintf( fout, "%d ", v[i] );
}
int main() {
FILE *fin, *fout;
fin = fopen( "algsort.in", "r" );
read( fin );
fclose( fin );
sort( v, v + n );
fout = fopen( "algsort.out", "w" );
write( fout );
fclose( fout );
}
