1076 排序 堆

1076 排序

 

时间限制: 1 s

空间限制: 128000 KB

题目等级 : 白银 Silver

 

 

 

 

题目描述 Description

给出n和n个整数，希望你从小到大给他们排序

输入描述 Input Description

第一行一个正整数n

#include<iostream>
#include<vector> 
#include<algorithm>
#include<cmath>
using namespace std;
int heap[1000000];
int heap_size=0;
int q;
void put(int d)                 //heap[1]为堆顶
{
    int now, next;
    heap[++heap_size] = d;
    now = heap_size;
    while(now > 1)
    {
        next = now >> 1;
        //next=now/(2,1);
        if(heap[now] >= heap[next]) break;
        swap(heap[now], heap[next]);
        now = next;
    }
}
/*void put(int d)
{
    heap[++heap_size] = d;
    //push_heap(heap + 1, heap + heap_size + 1);            //大根堆
    push_heap(heap + 1, heap + heap_size + 1, greater<int>()); //小根堆
}*/
int get()                //heap[1]为堆顶
{
    int now=1, next, res= heap[1];
    heap[1] = heap[heap_size--];
    while(now * 2 <= heap_size)
    {
        next = now * 2;
        if (next < heap_size && heap[next + 1] < heap[next]) next++;
        if (heap[now] <= heap[next]) break;
        swap(heap[now], heap[next]);
        now = next;
    }
    return res;
}
int main()
{
    cin>>q;
    for(int i=1;i<=q;i++)
     {
         cin>>heap[i];
         put(heap[i]);
     }
    for(int j=1;j<=q;++j)
    {
        cout<<heap[1]<<" ";
        get();
    }
    return 0;
}

第二行n个用空格隔开的整数

输出描述 Output Description

输出仅一行，从小到大输出n个用空格隔开的整数

样例输入 Sample Input

3

3 1 2

样例输出 Sample Output

1 2 3

数据范围及提示 Data Size & Hint

1<=n<=100000