Pagini recente » Cod sursa (job #519841) | Cod sursa (job #3128624) | Cod sursa (job #1617164) | Cod sursa (job #2176380) | Cod sursa (job #1724406)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
//#include <windows.h>
#include <deque>
//#include <Tlhelp32.h>
using namespace std;
//ifstream cin("jocul.in");
//ofstream cout("jocul.out");
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int x[100];
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
cin >> x[i];
make_heap(x, x + n);
sort_heap(x, x + n);
for(int i = 0; i < n; i++)
cout << x[i] << " ";
}