算法设计作业；贪心；

#include <iostream>#include <queue>#include <vector>#include <deque>using namespace std;int main(){priority_queue <int,deque<int>,greater<int>> heap;int max,min;//用几个数据测试一下for(int i=1;i<=10;++i){heap.push(i);}while(heap.size()>1){int a=heap.top();heap.pop();int b=heap.top();heap.pop();if(heap.size()==8){min=a*b+1;}heap.push(a*b+1);}max=heap.top();cout<<max-min<<endl;return 0;}

 

算法设计作业，贪心算法，4-26