Pagini recente » Borderou de evaluare (job #1555361) | Borderou de evaluare (job #1516438) | Cod sursa (job #1363473) | Borderou de evaluare (job #1970446) | Cod sursa (job #554188)
Cod sursa(job #554188)
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main() {
long n,i,a[500100];
freopen ("algsort.in","r",stdin);
freopen ("algsort.out","w",stdout);
scanf ("%d ",&n);
for (i=1;i<=n;i++) scanf ("%d",&a[i]);
make_heap(a+1,a+n+1);
sort_heap(a+1,a+n+1);
for (i=1; i<=n;i++) printf ("%d ",a[i]);
return 0;
}