Pagini recente » Borderou de evaluare (job #3235903) | Borderou de evaluare (job #1775336) | Borderou de evaluare (job #1713302) | Borderou de evaluare (job #1436646) | Cod sursa (job #1471971)
#include <fstream>
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
f >> n;
vector<int> v(n);
copy_n(istream_iterator<int>(f), n, begin(v));
auto it = end(v);
make_heap(begin(v), end(v));
for(int i = 0; i < n; ++i){
pop_heap(begin(v), it--); }
copy(begin(v), end(v), ostream_iterator<int>(g, " "));
return 0; }