题目描述
本题为填空题,只需要算出结果后,在代码中使用输出语句将所填结果输出即可。
作为篮球队教练,你需要从以下名单中选出 1 号位至 5 号位各一名球员,组成球队的首发阵容。
每位球员担任 1 号位至 5 号位时的评分如下表所示。请你计算首发阵容 1 号位至 5 号位的评分之和最大可能是多少?
运行限制
最大运行时间:1s
最大运行内存: 128M
#include <iostream>
using namespace std;
int one[20] = {
97, 92, 0, 0, 89, 82, 0, 0, 0, 95, 0, 0, 94, 0, 0, 0, 98, 93, 0, 0};
int two[20] ={
90, 85, 0, 0, 83, 86, 9, 97, 0, 99, 0, 0, 91, 83, 0, 0, 83, 87, 0, 99};
int three[20] = {
0, 96, 0, 0, 97, 0, 0, 96, 89, 0, 96, 0, 0, 87, 98, 0, 99, 92, 0, 96};
int four[20] = {
0, 0, 0, 80, 0, 0, 87, 0, 0, 0, 97, 93, 0, 0, 97, 93, 98, 96, 89, 95};
int five[20] = {
0, 0, 93, 86, 0, 0, 90, 0, 0, 0, 0, 98, 0, 0, 98, 86, 81, 98, 92, 81};
int main()
{
// 请在此输入您的代码
int maxsum = 0;
for (int i = 0; i < 20; ++i) {
for (int j = 0; j < 20; ++j) {
if (j == i) continue;
for (int k = 0; k < 20; ++k) {
if (k == i || k == j) continue;
for (int m = 0; m < 20; ++m) {
if (m == i || m == j || m == k) continue;
for (int n = 0; n < 20; ++n) {
if (n == i || n == j || n == k || n == m) continue;
if (one[i] + two[j] + three[k] + four[m] + five[n] > maxsum) {
maxsum = one[i] + two[j] + three[k] + four[m] + five[n];
}
}
}
}
}
}
cout << maxsum;
return 0;
}