2 solutions

  • 0
    @ 2026-2-19 20:47:19
    #include "bits/stdc++.h"
    using namespace std;
    struct c{
    	string name;
    	int ma,ch,en;
    	int q;
    };
    c a[1234];
    
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>a[i].name>>a[i].ch>>a[i].ma>>a[i].en;
    		a[i].q=a[i].ma+a[i].ch+a[i].en;
    	}
    	int maxx=1;
    	for(int i=1;i<=n;i++)
    	{
    		if(a[maxx].q<a[i].q)
    		{
    			maxx=i;
    		}
    	}
    	cout<<a[maxx].name<<" "<<a[maxx].ch<<" "<<a[maxx].ma<<" "<<a[maxx].en;
    	return 0;
    }
    
    • 0
      @ 2026-2-19 19:16:15
      #include<bits/stdc++.h>
      using namespace std;
      //结构体 struct 
      struct Stu{
      	string name;
      	int total,yuwen,shuxue,yingyu;
      };
      const int N=1010;
      Stu s[N];//s[i].name
      int main()
      {
      	int n;
      	cin>>n;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>s[i].name>>s[i].yuwen>>s[i].shuxue>>s[i].yingyu;
      		s[i].total=s[i].yuwen+s[i].shuxue+s[i].yingyu;
      	}
      	int maxid=1;
      	for(int i=1;i<=n;i++)
      	{
      		if(s[i].total>s[maxid].total)
      		{
      			maxid=i;
      		}
      	}
      	cout<<s[maxid].name<<" "<<s[maxid].yuwen<<" "<<s[maxid].shuxue<<" "<<s[maxid].yingyu<<endl;
      	return 0;
      }
      
      
      • 1

      Information

      ID
      1614
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      11
      Accepted
      4
      Uploaded By