排序好，好排名，然后按排名靠前到靠后的順序依次處理
#include<iostream>#include<vector>#include<algorithm>#PRagma warning(disable:4996)using namespace std;struct node {//輸入節(jié)點(diǎn) int id; int ge, gi, sum; vector<int> sc; int rank; bool Operator<(const node that)const { return sum > that.sum || (sum == that.sum && ge > that.ge); }};int N, M, K;vector<int> school;//存儲學(xué)校/專業(yè)要的人數(shù)vector<node> all;//存儲所有輸入vector<vector<int>> re;//結(jié)果vector<int> ra;//存儲過程中各個(gè)學(xué)校最后一名的rankint main(){ cin >> N >> M >> K; school.resize(M); all.resize(N); re.resize(M); ra.resize(M); for (int t = 0;t < M;t++) cin >> school[t]; for (int t = 0;t < N;t++)//存儲輸入 { all[t].id = t; scanf("%d %d", &all[t].ge, &all[t].gi); //cin >> all[t].ge >> all[t].gi; for (int i = 0;i < K;i++) { int aa; scanf("%d", &aa); //cin >> aa; all[t].sc.push_back(aa); if (getchar() == '/n') break; } all[t].sum = all[t].ge + all[t].gi; } sort(all.begin(), all.end());//排序 all[0].rank = 1; for (int t = 1;t < N;t++)//計(jì)算rank if (all[t].sum == all[t - 1].sum && all[t].ge == all[t - 1].ge) all[t].rank = all[t - 1].rank; else all[t].rank = t+1; for (auto x : all)//按排名對每一個(gè)學(xué)生進(jìn)行處理 { for (auto y : x.sc) if (re[y].size() < school[y] ||ra[y] == x.rank) { re[y].push_back(x.id);ra[y] = x.rank;break; } } for (auto &x : re)//輸出結(jié)果 { sort(x.begin(), x.end()); int f = 1; for (auto y : x) if (f == 1) { printf("%d", y);f = 0; } else printf(" %d", y); cout << endl; }}新聞熱點(diǎn)
疑難解答
