C++ 编程：计算黑衣人与其小队各获多少黄宝石

```cpp #include <iostream> #include <vector> #include <algorithm> int main() { int n; std::cin >> n; std::vector<int> fragmentWeights(n); for (int i = 0; i < n; ++i) { std::cin >> fragmentWeights[i]; } int m; std::cin >> m; std::vector<int> gemWeights(m); for (int i = 0; i < m; ++i) { std::cin >> gemWeights[i]; } int maxFragmentWeight = 0; for (int weight : fragmentWeights) { if (weight > maxFragmentWeight) { maxFragmentWeight = weight; } } int teamCount = 0; int selfCount = 0; for (int weight : gemWeights) { if (weight < maxFragmentWeight) { teamCount++; } else { selfCount++; } } std::cout << selfCount << " " << teamCount << std::endl; return 0; } ``` 代码解释： 1. 首先读取黄宝石碎片的数量`n`，并将每块碎片的重量存储在`fragmentWeights`向量中。 2. 接着读取黄宝石的数量`m`，并将每块黄宝石的重量存储在`gemWeights`向量中。 3. 遍历`fragmentWeights`向量，找出最重的黄宝石碎片的重量`maxFragmentWeight`。 4. 遍历`gemWeights`向量，根据每块黄宝石的重量与`maxFragmentWeight`的比较结果，分别统计黑衣人和小队能拿到的黄宝石数量。 5. 最后输出黑衣人和小队能拿到的黄宝石数量。 ######[AI问答 | 428点数解答 | 2025-10-18 19:17:09]