题解(内存较小)

#include<bits/stdc++.h>
using namespace std;
struct Node{
    string name;
    int y,s,id;
};
Node bs[105];
float ans;
string xs;
int a,b,c,n,m;
int main()
{
    cin>>n>>m;
	cout<<fixed<<setprecision(2);
    for(int i=1;i<=n;i++)
    {
        cin>>xs>>a>>b>>c;
        bs[i].name=xs;
        bs[i].id=a;
        bs[i].y=b;
        bs[i].s=c;
    }
    for(int i=1;i<=m;i++)
    {
        cin>>xs;
        if(xs=="name")
        {
            cin>>xs;
            for(int j=1;j<=n;j++)
            {
                if(xs==bs[j].name)
                {
                    cout<<bs[j].y<<" "<<bs[j].s<<"\n";
                    break;
                }
            }
        }
        else
        {
            cin>>a;
            for(int j=1;j<=n;j++)
            {
                if(a==bs[j].id)
                {
                    ans=(1.0*bs[j].y+bs[j].s)/2;
                    cout<<ans<<"\n";
                    break;
                }
            }
        }
    }
    return 0;
}