1018 锤子剪刀布 (20 分)

Notice:
1.输入字符时候按照BCJ的顺序可以使其相等时候按照字母顺序输出。
2.

#include <iostream>
using namespace std;
int main(){
    //1.保存输入
    int N;
    char a,b;
    //记录输出
    int win1,win2; //输赢的次数. int win1 = 0, win2 = 0;
    win1 = win2 = 0;
    int max1,max2;  //记录哪个最多
    max1 = max2 = -1;
    int jia[3] = {0}; //C J B赢的个数. int jia[3] = {0}, yi[3] = {0};
    int yi[3]  = {0};
    //2.处理
    cin >> N;
    for(int i = 0;i < N;i++){
        cin >> a >> b;
        if(a == 'B' && b == 'C'){
            win1++;
            jia[0]++;
        }else if(a == 'C' && b == 'J'){
            win1++;
            jia[1]++;
        }else if(a == 'J' && b == 'B'){
            win1++;
            jia[2]++;
        }else if(a == 'C' && b == 'B'){
            win2++;
            yi[0]++;
        }else if(a == 'J' && b == 'C'){
            win2++;
            yi[1]++;
        }else if(a == 'B' && b == 'J'){
            win2++;
            yi[2]++;
        }
    }
    int  maxpos1,maxpos2;
    maxpos1 = maxpos2 = 0;
    for(int i = 0;i < 3;i++){ 
        if(max1 <= jia[i]){    //此处应有等号，保证其相等情况下按照字母序输出
            max1 = jia[i];     //int maxjia = jia[0] >= jia[1] ? 0 : 1;
            maxpos1 = i;       //maxjia = jia[maxjia] >= jia[2] ? maxjia : 2;
        }
        if(max2 <= yi[i]){
            max2 = yi[i];
            maxpos2 = i;
        }
    }
    
    //3.输出
    char c[3]; //char str[4] = {"BCJ"};  要按照B、C、J的顺序输入
    c[0] = 'B';
    c[1] = 'C';
    c[2] = 'J';
    cout << win1 << " " << N - win1 -win2 << " " << win2 << endl;
    cout << win2 << " " << N - win1 -win2 << " " << win1 << endl;
    cout << c[maxpos1] << " " << c[maxpos2]; //cout << str[maxjia] << " " << str[maxyi]
    return 0;
}