codeforces上一道贪心算法题

http:codeforces.comcontest218problemB贪心算法：STL优先队列实现最大堆，最小堆#includeiostream#i

http://codeforces.com/contest/218/problem/B

贪心算法：

STL优先队列实现最大堆，最小堆

#include#include using namespace std;const int MAX=1001;int a[MAX];int calPrize(int n, int x){ int start=n-x+1; return (start+n)*x/2;} int fun(int n, int m, int pos[]){ priority_queueheap;//最小堆 priority_queueheap2;//最大堆 for(int i=0;i1) heap2.push(tmp-1); } cout<n>>m; for(int i=0;i>a[i]; fun(n,m,a); //cin>>m;}