STL中priority_queue容器的应用,反正题目就是基于贪心的原则
#include <cstdio>
#include <iostream>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
using namespace std;
// http://acm.hdu.edu.cn/showproblem.php?pid=4302
const int MAXN = 100005;
priority_queue<int> aa;
priority_queue< int, vector<int>, greater<int> > bb;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int t, cs = 0;......
阅读全文