优化#include <string.h> #include <iostream> using namespace std; struct book { int price; char m; }; //请在此添加代码，实现书籍数据的输入、排序和输出 /********** Begin *********/ int main() { struct books[100]; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> books[i].price >> books[i].m; } for (int i = 0; i < n; i++) { book tmp; if (books[i].price > books[i + 1].price) { tmp = books[i]; books[i] = books[i + 1]; books[i + 1] = tmp; } if (books[i].price = books[i + 1].price) { if (strcmp(books[i].m, books[i + 1].m) > 0) { book tmp; books[i] = books[i + 1]; books[i + 1] = tmp; } } } for (int i = 0; i < n; i++) { cout << books.price << "," << books.m << endl; } return 0; } /********** End **********/

以下是优化过的代码：

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

struct book {
    int price;
    char m;
};

bool cmp(book a, book b) {
    if (a.price == b.price) {
        return a.m < b.m;
    }
    return a.price < b.price;
}

int main() {
    book books[100];
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> books[i].price >> books[i].m;
    }   
    sort(books, books + n, cmp); 
    for (int i = 0; i < n; i++) {
        cout << books[i].price << "," << books[i].m << endl;
    }   
    return 0;
}

主要优化如下：

1. 使用 `sort` 函数代替手写排序，简化代码，同时也提高了效率。
2. 在 `struct book` 中，将 `m` 的类型改为 `char`，避免了在排序时使用 `strcmp` 函数，也减少了代码量。
3. 将排序函数 `cmp` 定义为 `bool` 类型，使得代码更加直观易懂。