1028.List Sorting (25)
pat-al-1028
2017-02-05
有測試點(diǎn)運(yùn)行超時(shí)但覺得沒什么問題的時(shí)候可以嘗試把cin和cout換成scanf和PRintfchar字符串?dāng)?shù)組比較必須用strcmp函數(shù)，而不能像string類型可以直接比較坑見注釋/** * pat-al-1028 * 2017-02-05 * Cpp version * Author: fengLian_s */#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>//坑：strcmp在<string.h>中，不是在<string>中#define MAX 100001using namespace std;int c;struct STU{ int id; char name[10]; int score;}stu[MAX];bool cmp(STU a, STU b){ if(c == 1) return a.id < b.id; else if(c == 2) { if(strcmp(a.name, b.name) != 0) return strcmp(a.name, b.name) < 0;//因?yàn)椴荒苡胹tring類型，只能用char字符數(shù)組，所以只能用strcmp來比較 else return a.id < b.id; } else { if(a.score != b.score) return a.score < b.score; else return a.id < b.id; }}int main(){ int n; cin >> n >> c; for(int i = 0;i < n;i++) { scanf("%d%s%d", &stu[i].id, stu[i].name, &stu[i].score);//不能用下面注釋掉的那行，會(huì)運(yùn)行超時(shí) //cin >> stu[i].id >> stu[i].name >> stu[i].score; //cout << stu[i].id << stu[i].name << stu[i].score << endl; } sort(stu, stu+n, cmp); for(int i = 0;i < n;i++) { printf("%06d %s %d/n", stu[i].id, stu[i].name, stu[i].score); } return 0;}-FIN-
新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
