小编hem*_*ngh的帖子

我有以下数据结构,

typedef vector< tuple<int,int,int> > vector_tuple;

在矢量我存储 tuple<value,count,position>

我想根据计数对矢量进行排序,如果计数相同则基于位置对矢量进行排序.

structure ordering
{
  bool ordering()(....)
  {
    return /// ?
  }

};
int main()
{ 
    std::vector<int> v1{1,1,1,6,6,5,4,4,5,5,5};
    std::vector<int> v2(v1);
    vector_tuple vt;
    std::tuple<int,int,int> t1;
    std::vector<int>::iterator iter;
    int sizev=v1.size();
    for(int i=0; i < sizev ; i++)
    {
         auto countnu = count(begin(v2),end(v2),v1[i]);  
         if(countnu > 0)
         {
           v2.erase(std::remove(begin(v2),end(v2),v1[i]),end(v2));
           auto t = std::make_tuple(v1[i], countnu, i);
           vt.push_back(t);
         }
     }
     sort(begin(vt),end(vt),ordering(get<1>vt); // I need to sort based on count and if count is same, sort based on position.


     for …