PTA乙级 （1058 选择题 (20分)）

1058 选择题 (20分)

https://pintia.cn/problem-sets/994805260223102976/problems/994805270356541440

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
    int n,m;
    int i,j,k,sum=0;
    bool flag=true;
    int full_score[102],count_opt[102],count_corropt[102],temp,a[102]={0};
    char chr[102][7],stu_chr[102][7],chr1;
    cin>>n>>m;
    for(i=0;i<m;i++)
    {
        cin>>full_score[i]>>count_opt[i]>>count_corropt[i];
        for(j=0;j<count_corropt[i];j++) cin>>chr[i][j];
    }
    for(i=0;i<n;i++)
    {
        sum=0;
        for(k=0;k<m;k++){
        flag=true;
        cin>>chr1>>temp;
        if(temp!=count_corropt[k]) flag=false;
        for(j=0;j<temp;j++){
            cin>>stu_chr[k][j];
            if((stu_chr[k][j]!=chr[k][j])&&(flag==true)) flag=false; 
        } 
        if(flag) sum+=full_score[k];
        else if(!flag)
        {
            a[k+1]++;
         } 
        cin>>chr1;
        }
        cout<<sum<<endl;
    }
    int max=-1; 
    for(i=1;i<=m;i++)
    {
        if(a[i]>max) max=a[i];
    }
    if(max==0) cout<<"Too simple
";
    else{
        cout<<max;
        for(i=1;i<=m;i++)
         if(a[i]==max) cout<<" "<<i;
    }
    return 0;
}