思路:
直接暴力
c o d e code code
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int n, m, f[110][4], z[110][2];
struct node
{
string name;
int id, rank, grade;
}s[110];
bool check(string s1, string s2)
{
int i=0, j=0;
while(s1[i]!=' '&&s2[j]!=' ')
i++, j++;
if(s1[i]==' '&&s2[j]!=' ')
return 1;
if(s2[j]==' '&&s1[i]!=' ')
return 0;
i=0, j=0;
while(s1[i]!=' '&&s2[j]!=' ')
{
if(s1[i]>s2[j])
return 0;
if(s2<