1137 Final Grading (25 分)

最新推荐文章于 2024-06-13 17:48:22 发布

原创最新推荐文章于 2024-06-13 17:48:22 发布 · 404 阅读

0 ·

CC 4.0 BY-SA版权

PTA 专栏收录该内容

3 篇文章

订阅专栏

这个C++程序用于处理学生的期中、期末和实践成绩，计算最终成绩并进行排序。当原理成绩相同时，按学号升序排列。程序中cmp函数用于比较学生最终成绩。

有点坑，最后一个例子一直错，好久才发现cmp函数没写好，原理成绩相等的情况要字符串比较

#include <iostream>
#include<algorithm>
#include<map>
#include<vector>

using namespace std;

bool cmp(const pair<string, vector<int>>& a, const pair<string, vector<int>>& b) {
   if (a.second[3] == b.second[3])
       return a.first < b.first;
   return a.second[3] > b.second[3];
}
int main(void)
{
   map<string, vector<int>> stus;
   int P, M, N;
   string stuid;

   cin >> P >> M >> N;
   for (int i = 0; i < P; ++i)
   {
       int GP;
       cin >> stuid>>GP;
       vector<int> scores(4, -1);
       scores[0] = GP;
       stus[stuid] = scores;
   }
   for (int i = 0; i < M; ++i)
   {
       int GM;
       cin >> stuid>>GM;
       if (stus.count(stuid) == 1)
           stus[stuid][1] = GM;
   }
   for (int i = 0; i < N; ++i)
   {
       int GF;
       cin >> stuid>>GF;
       if (stus.count(stuid) == 1)
           stus[stuid][2] = GF;
   }

   vector<pair<string, vector<int>>> vec;
   auto pairs = stus.begin();
   while (pairs!=stus.end())
   {
       if (pairs->second[0] >= 200)
       {
           if (pairs->second[1] > pairs->second[2])
               pairs->second[3] = int(pairs->second[1] * 0.4 + pairs->second[2] * 0.6+0.5);
           else
               pairs->second[3] = pairs->second[2];
           if (pairs->second[3] >= 60)
               vec.push_back(*pairs);
       }
       pairs++;
   }

   sort(vec.begin(), vec.end(), cmp);
   auto pai = vec.begin();
   while (pai!=vec.end())
   {
       cout << pai->first <<" "<< pai->second[0] <<" "<< pai->second[1]<<" "<<pai->second[2]<<" "<<pai->second[3]<<endl;
       pai++;
   }

return 0;
}