2 条题解

  • 2
    @ 2022-8-27 11:28:48
    #include<bits/stdc++.h>
    using namespace std;
    string first_name;
    int n,maxans=0,sum=0;
    string name;
    int final_mark,senate_mark,paper;
    char cadres_stu,south_stu;
    int main(){
    	cin>>n;
    	for(int i=1;i<=n;i++){
    		int t=0;
    		cin>>name>>final_mark>>senate_mark;
    		cin>>cadres_stu>>south_stu>>paper;
    		if(final_mark>80 && paper>0) t+=8000;
    		if(final_mark>85 && senate_mark>80) t+=4000;
    		if(final_mark>90) t+=2000;
    		if(final_mark>85 && south_stu=='Y') t+=1000;
    		if(senate_mark>80 && cadres_stu=='Y') t+=850;
    		sum+=t;
    		if(t>maxans){
    			maxans=t;
    			first_name=name;
    		}
    	}
    	cout<<first_name<<endl<<maxans<<endl<<sum<<endl;
    	return 0;
    } 
    
    • 0
      @ 2023-10-18 21:48:15

      纯比较,没有什么难度,就是写着麻烦一点

      #include <bits/stdc++.h>
      using namespace std;
      int n;
      int main()
      {
          cin>>n;
          int maxxqian=-1;
          string maxxname="";
          int sum=0;
          for(int i=1;i<=n;i++)
          {
              string name;
              char ganbu,xibu;
              int score,ban,lun;
              cin>>name>>score>>ban>>ganbu>>xibu>>lun;
              int qian=0;
              if(score>80&&lun>=1)qian+=8000;
              if(score>85&&ban>80)qian+=4000;
              if(score>90)qian+=2000;
              if(score>85&&xibu=='Y')qian+=1000;
              if(ban>80&&ganbu=='Y')qian+=850;
              if(qian>maxxqian){maxxqian=qian;maxxname=name;}
              sum+=qian;
          }
          cout<<maxxname<<endl<<maxxqian<<endl<<sum<<endl;
          return 0;
      }
      
      • 1

      [NOIP2005 提高组] 谁拿了最多奖学金

      信息

      ID
      52
      时间
      1000ms
      内存
      125MiB
      难度
      2
      标签
      递交数
      38
      已通过
      26
      上传者