#include<iostream>
#include<set>
using namespace std;
int main()
{
int k=4,max =0 ,min =0;//k 为带合并的序列个数,min,max 分别为所需最少和最多的比较次数
int num[] = {5,12,11,2};
set<int>myset(num,num+4);
set<int>myset2(myset);
set<int>::iterator it;
/* myset.insert(5);
myset.insert(12);
myset.insert(11);
myset.insert(2);
*/
//最少比较次数
while(myset.size() != 1)
{
it = myset.begin();//两个最小的数相加，加完后删除这两个数，并把相加的结果插入到 set
容器中
int a = *it;
myset.erase(it);
it = myset.begin();
int b = *it;
myset.erase(it);
int c = a+b;
myset.insert(a+b);
min += c-1;
}
cout<<"最少的比较次数为:"<<min<<endl;
for(it = myset2.begin(); it!=myset2.end();it++)
cout<<*it<<ends;
cout<<endl;
//计算最多比较次数
while(myset2.size() != 1)
{
评论3