解题代码
#include<cstdio>
struct stu {
int weight;
int ans;
}s[100];
int n, m, sum, temp;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
scanf("%d", &s[i].weight);
for (int i = 0; i < m; i++)
scanf("%d", &s[i].ans);
for (int i = 0; i < n; i++) {
sum = 0;
for (int j = 0; j < m; j++) {
scanf("%d", &temp);
if (temp == s[j].ans) sum += s[j].weight;
}
printf("%d\n", sum);
}
return 0;
}
测试结果

问题整理
1.基础题目。
909

被折叠的 条评论
为什么被折叠?



