Cod sursa(job #1457722)
Utilizator | Data | 4 iulie 2015 11:49:32 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
ifstream fin ( "algsort.in" ) ;
ofstream fout ( "algsort.out" ) ;
vector< int > vect ;
int main()
{
int N, x , i ;
fin >> N;
for( i = 0; i < N; ++ i )
{
fin >> x;
vect.push_back( x );
}
make_heap( vect.begin(), vect.end() );
sort_heap( vect.begin(), vect.end() );
for( i = 0; i < N; ++ i )
fout << vect [i] << ' ';
fin.close() , fout.close() ;
return 0;
}