1 /**************************************************
2 Target: To realize the Priority_queue
3 Author: Xue Zhonghao
4 Date: 2014-3-5 21:30:34
5 **************************************************/
6 #include<cstdio>
7 #include<cstdlib>
8 #include<queue>
9 #include<iostream>
10 using namespace std;
11
12 struct Item {
13 int val;
14 bool operator < (const Item& a) const { // 这句话不能改，包括“<”
15 return val > a.val;//大于小于表示升降序
16 }
17 };
18
19 int main(void)
20 {
21 priority_queue<Item> q;
22 Item item;
23 int N;
24 cin>>N;
25 for(int i = 0; i < N; ++i) { cin>>item.val; q.push(item); }
26 cout<<endl<<endl;
27 for(int i = 0; i < N; ++i) { item = q.top(); cout<<item.val<<endl; q.pop(); }
28 system("pause");
29 return 0;
30 }
