PTA MOOC期终成绩(c++)

1080 MOOC期终成绩 (25分)

在这里插入图片描述

输入样例:

6 6 7
01234 880
a1903 199
ydjh2 200
wehu8 300
dx86w 220
missing 400
ydhfu77 99
wehu8 55
ydjh2 98
dx86w 88
a1903 86
01234 39
ydhfu77 88
a1903 66
01234 58
wehu8 84
ydjh2 82
missing 99
dx86w 81

输出样例:missing 400 -1 99 99

ydjh2 200 98 82 88
dx86w 220 88 81 84
wehu8 300 55 84 84

样例解答:

#include <bits/stdc++.h>
using namespace std;
struct str{
 string name;
 int gp,gm,gf,g;
}; 
int compare(str s1,str s2){
 if(s1.g!=s2.g)
  return s1.g>=s2.g;
 return s1.name<s2.name;
}
int main(int argc, char** argv) {
 int P,M,N;
 cin>>P>>M>>N;
 str st[10005];
 int num = 1;
 map<string,int> m;
 string name;
 int gra;
 for(int i=0;i<P;i++){
  cin>>name>>gra;
  if(gra>=200){
   str s={name,gra,-1,-1,0};
   m[s.name] = num;
   st[num++]=s;
  }
 }
 for(int i=0;i<M;i++){
  cin>>name>>gra;
  if(m[name]!=0){
   st[m[name]].gm=gra;
  }
 }
 for(int i=0;i<N;i++){
  cin>>name>>gra;
  if(m[name]!=0){
   st[m[name]].gf=st[m[name]].g=gra;
   if(st[m[name]].gm>st[m[name]].gf){
    st[m[name]].g=int(st[m[name]].gm*0.4+st[m[name]].gf*0.6+0.5);
   }
  }
 }
 sort(st+1,st+num,compare);
 for(int i=0;i<num;i++){
  if(st[i].g>=60){
   cout<<st[i].name<<" "<<st[i].gp<<" "<<st[i].gm<<" "<<st[i].gf<<" "<<st[i].g<<endl;
  }
 }
}

猜你喜欢

转载自blog.csdn.net/OAOII/article/details/108265359