3 solutions

  • 2
    @ 2025-6-9 18:06:41
    #include<bits/stdc++.h>
    using namespace std;
    const int N=110;
    struct Stu{
    	string name;
    	int sc;
    };
    Stu stu[N]; 
    bool cmp(Stu a,Stu b) //a表示数组的前面的元素,b表示数组后面的元素 
    {
    	if(a.sc>b.sc) return 1;
    	if(a.sc==b.sc&&a.name<b.name) return 1;
    	return 0; 
    }
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>stu[i].name>>stu[i].sc;
    	}
    	sort(stu+1,stu+n+1,cmp);//将stu[1]到stu[n]按照cmp的规则排序 
    	for(int i=1;i<=n;i++)
    	{
    		cout<<stu[i].name<<" "<<stu[i].sc<<endl;
    	}
    }
    
    
    • 1
      @ 2025-6-9 18:17:00
      #include<bits/stdc++.h>
      using namespace std;
      const int N=110;
      struct Stu{
          string name;
          int sc;
      };
      Stu stu[N];
      bool cmp(stu a,stu b)
      {
          if(a.sc>b.sc) return 1;
      	if(a.sc==b.sc&&a.name<b.name) return 1;
      	return 0; 
      }
      int main()
      {
          int n;
          cin>>n;
          for(int i=1;i<=n;i++)
          {
              cin>>stu[i].name>>stu[i].sc;
          }
          sort(stu+1,stu+n+1,cmp);//将stu[i]到stu[n]按照cmp规则排序
          for(int i=1;i<=n;i++)
          {
              cout<<stu[i].name<<" "<<stu[i].sc<<endl;
          }
          return 0;
      }
      
      • 1
        @ 2024-8-22 14:11:30
        #include<bits/stdc++.h>
        using namespace std;
        const int N=35;
        struct Student
        {
        	string name;
        	int sc;
        }s[N];
        bool cmp(Student a,Student b)
        {
        	if(a.sc>b.sc) return 1;
        	if(a.sc==b.sc&&a.name<b.name) return 1;
        	return 0;
        }
        int main()
        {
        	int n;
        	cin>>n;
        	for(int i=0;i<n;i++)
        	{
        		cin>>s[i].name>>s[i].sc;
        	}
        	sort(s,s+n,cmp);
        	for(int i=0;i<n;i++)
        	{
        		cout<<s[i].name<<" "<<s[i].sc<<endl;
        	}
        }
        
        • 1

        Information

        ID
        943
        Time
        1000ms
        Memory
        256MiB
        Difficulty
        1
        Tags
        (None)
        # Submissions
        91
        Accepted
        28
        Uploaded By