第一题
笔记:
jiawin、yiwin分别表示甲乙赢的次数,s和t分别表示每一次甲乙给出的手势,maxjia和maxyi分别表示甲乙获胜次数最多的手势所对应的下标(012分别表示BCJ),枚举每一次甲乙手势的胜负结果并累加到jiawin和yiwin中,最后根据题目要求输出结果
代码:
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int jiawin = 0, yiwin = 0;
int jia[3] = {0}, yi[3] = {0};
for (int i = 0; i < n; i++) {
char s, t;
cin >> s >> t;
if (s == 'B' && t == 'C') {
jiawin++;
jia[0]++;
} else if (s == 'B' && t == 'J') {
yiwin++;
yi[2]++;
} else if (s == 'C' && t == 'B') {
yiwin++;
yi[0]++;
} else if (s == 'C' && t == 'J') {
jiawin++;
jia[1]++;
} else if (s == 'J' && t == 'B') {
jiawin++;
jia[2]++;
} else if (s == 'J' && t == 'C') {
yiwin++;
yi[1]++;
}
}
cout << jiawin << " " << n - jiawin - yiwin << " " << yiwin << endl << yiwin << " " << n - jiawin - yiwin << " " << jiawin << endl;
int maxjia = jia[0] >= jia[1] ? 0 : 1;
maxjia = jia[maxjia] >= jia[2] ? maxjia : 2;
int maxyi = yi[0] >= yi[1] ? 0 : 1;
maxyi = yi[maxyi] >= yi[2] ? maxyi : 2;
char str[4] = {"BCJ"};
cout << str[maxjia] << " " << str[maxyi];
return 0;
}
第二题
笔记:
- 因为涉及到数字中每一位要重新排序,用字符串输入比较方便,要注意的是当数字不足4位的时候要在前面补0
s.insert(0, 4 – s.length(), ‘0’);用来给不足4位的时候前面补0
- 因为还要涉及数字的计算,所以要在字符串和数字间不断转换。
itoa()将字符串转换为数字
to_string()将数字转换为字符串
4.通过 bool cmp(char a, char b) {return a > b;}
和sort(a.begin(), a.end(), cmp);
可以实现对字符串中的数字降序排序。
sort(b.begin(), b.end()); 默认对字符串升序排序
第三题
笔记:
- 首先算出每个月饼的单价,然后按单价从高到低排序,优先卖出单价高的,如果卖了了再继续卖下一种月饼,直到满足市场需求。
代码:
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct mooncake{
float mount, price, unit;
};
int cmp(mooncake a, mooncake b) {
return a.unit > b.unit;
}
int main() {
int n, need;
cin >> n >> need;
vector<mooncake> a(n);
for (int i = 0; i < n; i++) scanf("%f", &a[i].mount);
for (int i = 0; i < n; i++) scanf("%f", &a[i].price);
for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
sort(a.begin(), a.end(), cmp);
float result = 0.0;
for (int i = 0; i < n; i++) {
if (a[i].mount <= need) {
result = result + a[i].price;
} else {
result = result + a[i].unit * need;
break;
}
need = need - a[i].mount;
}
printf("%.2f",result);
return 0;
}