1018 锤子剪刀布 (20 分)
PTA 乙级练习题

#include<iostream>
#include <queue>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<math.h>
#include <iomanip> 
#include <algorithm>
#include <string>
#pragma warning(disable:4996)
using namespace std;
struct info
{
	int sheng;
	int fu;
	int ping;
	map<char, int> shengli{ {'J',0},{'B',0},{'C',0} };
};
int panduan(char a, char b)
{
	if (a == 'J')
	{
		switch (b)
		{
		case 'B': return 1;
		case 'C': return 2;
		case 'J': return 0;
		default:
			break;
		}
	}
	else if (a == 'C')
	{
		switch (b)
		{
		case 'B': return 2;
		case 'C': return 0;
		case 'J': return 1;
		}
	}
	else if (a == 'B')
	{
		switch (b)
		{
		case 'B': return 0;
		case 'C': return 1;
		case 'J': return 2;
		}
	}
}
char max(map<char, int> a)
{
	char c = a.begin()->first;
	int b = a.begin()->second;
	for (auto i = a.begin();i != a.end();i++)
	{
		if (i->second > b)
		{
			c = i->first;
			b = i->second;
		}
	}
	return c;
}
int main()
{
	int n;
	cin >> n;
	//cout << endl;
	char jia, yi;
	info j{ j.sheng = 0,j.fu = 0,j.ping=0 }, y{ y.sheng = 0,y.fu = 0,j.ping=0 };
	for (int i = 0;i < n;i++){
		//getchar  把回车清了 不然获取的时候有问题
		getchar();
		scanf("%c %c", &jia, &yi);
		//cout << 11;
		//cout << 15;
		//printf("甲%c乙%c\n", jia, yi);
		if (panduan(jia, yi) == 1)
		{
			j.sheng++;
			j.shengli[jia]++;
			y.fu++;
		}
		else if(panduan(jia,yi)==2)
		{
			j.fu++;
			y.sheng++;
			y.shengli[yi]++;
		}
		else if (panduan(jia, yi) == 0)
		{
			j.ping++;
			y.ping++;
		}
	}
	/*for (auto i = j.shengli.begin();i != j.shengli.end();i++)
	{
		cout << i->first << " " << i->second<<endl;
	}*/
	printf("%d %d %d\n", j.sheng, j.ping, j.fu);
	printf("%d %d %d\n", y.sheng, y.ping, y.fu);
	printf("%c %c", max(j.shengli), max(y.shengli));
}