#include<bits/stdc++.h> #include<algorithm> #include<string> #include<cctype> using namespace std;struct node{string name;double mk = 0;int num = 0; }arr[100009]; bool cmp(node a, node b){int na = (int)a.mk; //只取整數部分 int nb = (int)b.mk;if(na == nb) {if (a.num == b.num) return a.name < b.name;else return a.num < b.num;} else return na > nb; }int main() {int n, idx = 0, s;scanf("%d", &n);string nid, name;map<string, int> mapp;for (int i = 0; i < n; i++) {cin>>nid>>s>>name;//transform(name.begin(), name.end(), name.begin(), ::tolower);此辦法也可 for (int j = 0; j < name.length(); j++) //化為小寫 name[j] = tolower(name[j]);if (mapp.count(name) == 0) {mapp[name] = idx++;}arr[mapp[name]].name = name;if (nid[0] == 'B') arr[mapp[name]].mk += 1.0 * (s / 1.5);else if (nid[0] == 'A') arr[mapp[name]].mk += 1.0 * s;else arr[mapp[name]].mk += 1.0 * (s * 1.5);arr[mapp[name]].num++;}sort(arr, arr+idx, cmp);printf("%d\n", idx); //最開始忘了輸出這個提交后全是WA，嚇了我一跳 int pid = 1, p = 0;for (int i = 0; i < idx; i++) {int mi = (int)arr[i].mk; //注意化為整數 int mp = (int)arr[p].mk;if (mi != mp) {pid = i + 1;p = i;} printf("%d ", pid);cout<<arr[i].name;printf(" %d %d\n",mi, arr[i].num);}return 0; }

總結

以上是生活随笔為你收集整理的PAT_B_1085_Java(25分)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。