std::sort

#include<iostream>
#include<vector>
#include<algorithm>


struct PathTrie{
        int score;
        char character;
        int id;
}*aa,*bb,*cc,*dd;


bool prefix_compare(const PathTrie *x, const PathTrie *y) {
  if (x->score == y->score) {
    if (x->character == y->character) {
      return false;
    } else {
      return (x->character > y->character);
    }
  } else {
    return x->score > y->score;
  }
}

int main(){

    struct PathTrie a={1,1,1};
    struct PathTrie d={4,4,2};
    struct PathTrie c={3,3,3};
    struct PathTrie b={4,2,4};
    std::vector<PathTrie *> prefixes;

    aa=&a;
    bb=&b;
    cc=&c;
    dd=&d;
    prefixes.push_back(aa);
    prefixes.push_back(dd);
    prefixes.push_back(cc);
    prefixes.push_back(bb);
    std::cout << prefixes[0]->score << " " << prefixes[0]->character<< " " << prefixes[0]->id << std::endl;
    std::cout << prefixes[1]->score << " " << prefixes[1]->character<< " " << prefixes[1]->id << std::endl;
    std::cout << prefixes[2]->score << " " << prefixes[2]->character<< " " << prefixes[2]->id << std::endl;
    std::cout << prefixes[3]->score << " " << prefixes[3]->character<< " " << prefixes[3]->id << std::endl;

    std::sort(prefixes.begin(),prefixes.begin()+4,prefix_compare);

    std::cout << prefixes[0]->score << " " << prefixes[0]->character<< " " << prefixes[0]->id << std::endl;
    std::cout << prefixes[1]->score << " " << prefixes[1]->character<< " " << prefixes[1]->id << std::endl;
    std::cout << prefixes[2]->score << " " << prefixes[2]->character<< " " << prefixes[2]->id << std::endl;
    std::cout << prefixes[3]->score << " " << prefixes[3]->character<< " " << prefixes[3]->id << std::endl;

    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值