Cod sursa(job #3297330)
| Utilizator | Data | 22 mai 2025 14:17:40 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
#include <vector>
#include <algorithm>
int main() {
FILE *fin = fopen( "algsort.in", "r" );
FILE *fout = fopen( "algsort.out", "w" );
int n;
fscanf( fin, "%d", &n );
std::vector<int> v(n);
for( int i = 0; i < n; i++ )
fscanf( fin, "%d", &v[i] );
std::sort( v.begin(), v.end() );
for( int x : v )
fprintf( fout, "%d ", x );
fputc( '\n', fout );
fclose( fin );
fclose( fout );
return 0;
}
