qq_46194023的博客

传送门 1.重载 < 2.set //解法一 #include <cstdio> #include <set> using namespace std; int book[50001]; struct node { int value, cnt; node(int a, int b):value(a), cnt(b){} bool operator < (const node &a) const { return (cnt

1.模拟 2.结构体排序 3.个顶序列赋排名 #include<bits/stdc++.h> using namespace std; vector<vector<int > > school; int n,k,c; struct node{ int id; int ge,gl; int sum; int c_s[5]; }; vector<node > people; vector<int > w,ranks; b

传送门 dfs+模拟 回溯：维护rank 按权值排序 STL:a.insert(a.end(),b.begin(),b.end()); 将一个容器拼接到另一容器尾部 #include<bits/stdc++.h> using namespace std; int n ,m,ranks=0; vector<int > ans, weight,indexs; bool cmp(int a,int b){ return weight[a] < weight[b]; } //