综合大闯关+结业授勋

#include <bits/stdc++.h>
using namespace std;

int fa[100005];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }

int main() {
    for (int i = 1; i <= 5; i++) fa[i] = i;
    fa[find(1)] = find(2);     // 1、2 结成同伙
    priority_queue<int> q;     // 大根堆存各队战力
    q.push(100); q.push(85);
    cout << "最强战力: " << q.top() << endl;  // 100
    return 0;
}