64,674
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
typedef unsigned long ulong;
typedef pair<ulong,ulong> aPair; //a room with its diversity
class aVal_Pair:public pair<ulong,aPair>{
public:
aVal_Pair(int a,const aPair &b):pair<int,aPair>(a,b){}
bool operator<(const aVal_Pair &p)const { return this->first>p.first;}
};
int main (void)
{
vector<aVal_Pair> vp;
vp.push_back(aVal_Pair(1,aPair(2,3)));
vp.push_back(aVal_Pair(5,aPair(1,5)));
vp.push_back(aVal_Pair(3,aPair(8,2)));
vp.push_back(aVal_Pair(6,aPair(1,4)));
vp.push_back(aVal_Pair(2,aPair(2,3)));
sort(vp.begin(),vp.end());
for (int i=0;i<5;i++)
cout<<vp[i].first<<" "<<vp[i].second.first<<endl;
return 0;
}
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef unsigned long ulong;
typedef pair<ulong,ulong> aPair; //a room with its diversity
class aVal_Pair:public pair<ulong,aPair>{
public:
aVal_Pair(int a,const aPair &b):pair<ulong,aPair>(a,b){}
bool operator<(const aVal_Pair &p)const { return this->first>p.first;}
};
int main (void)
{
vector<aVal_Pair> vp;
vp.push_back(aVal_Pair(1,aPair(2,3)));
vp.push_back(aVal_Pair(5,aPair(1,5)));
vp.push_back(aVal_Pair(3,aPair(8,2)));
vp.push_back(aVal_Pair(6,aPair(1,4)));
vp.push_back(aVal_Pair(2,aPair(2,3)));
sort(vp.begin(),vp.end());
for (int i=0;i<5;i++)
cout<<vp[i].first<<" "<<vp[i].second.first<<endl;
return 0;
}