種子論壇 | 高雄市資訊培育協會學員討論區

#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
//#include <algorithm>
//#include <tuple>
using namespace std;
// 應徵者結構體
struct Applicant {
int id, x, y, z;
Applicant(int id, int x, int y, int z) : id(id), x(x), y(y), z(z) {}
};
// 自訂排序方式 (根據單職位能力排序)
bool cmpX(const Applicant &a, const Applicant &b) { return a.x > b.x; }
bool cmpY(const Applicant &a, const Applicant &b) { return a.y > b.y; }
bool cmpZ(const Applicant &a, const Applicant &b) { return a.z > b.z; }
int main() {
int n, a, b, c;
cin >> n >> a >> b >> c;
vector<Applicant> applicants;
// 讀取輸入資料
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
applicants.emplace_back(i, x, y, z);
}
// 記錄被選中的應徵者
vector<bool> selected(n, false);
int maxPower = 0;
// **Step 1: 選擇最強的工程師**
sort(applicants.begin(), applicants.end(), cmpX);
for (int i = 0; i < a && i < n; i++) {
maxPower += applicants[i].x;
selected[applicants[i].id] = true;
}
// **Step 2: 選擇最強的清潔工**
sort(applicants.begin(), applicants.end(), cmpY);
int cleanCount = 0;
for (int i = 0; i < n && cleanCount < b; i++) {
if (!selected[applicants[i].id]) { // 尚未被選為工程師
maxPower += applicants[i].y;
selected[applicants[i].id] = true;
cleanCount++;
}
}
// **Step 3: 選擇最強的小丑**
sort(applicants.begin(), applicants.end(), cmpZ);
int clownCount = 0;
for (int i = 0; i < n && clownCount < c; i++) {
if (!selected[applicants[i].id]) { // 尚未被選為工程師或清潔工
maxPower += applicants[i].z;
clownCount++;
}
}
// **Step 4: 找雙職位的應徵者補充**
vector<tuple<int, int, int>> dualOptions; // (應徵者ID, 增加的實力, 類型)
for (int i = 0; i < n; i++) {
if (!selected[applicants[i].id]) continue;
int extraPower = 0;
int type = -1;
// 這個人已被選擇，但還能補其他職位
if (cleanCount < b) {
extraPower = applicants[i].y;
type = 1; // 增加清潔工
}
if (clownCount < c && applicants[i].z > extraPower) {
extraPower = applicants[i].z;
type = 2; // 增加小丑
}
if (type != -1) {
dualOptions.emplace_back(applicants[i].id, extraPower, type);
}
}
// 按額外實力排序，選擇最優解
sort(dualOptions.begin(), dualOptions.end(), [](const tuple<int, int, int> &a, const tuple<int, int, int> &b) {
return get<1>(a) > get<1>(b);
});
for (auto &[id, extra, type] : dualOptions) {
if (type == 1 && cleanCount < b) { // 增加清潔工
maxPower += extra;
cleanCount++;
} else if (type == 2 && clownCount < c) { // 增加小丑
maxPower += extra;
clownCount++;
}
}
// **輸出最大總實力**
cout << maxPower << endl;
return 0;
}

複製代碼