使用顺序表等其他方法修改此代码：#ifndef NULL #define NULL 0 #endif #include #include #include using namespace std; struct LNode { //存储数据 int month; int day; string name; double price; LNode* next;//后继指针 LNode() {}; LNode(int a,...-Go服务器开发

下面是使用顺序表修改后的代码：

#ifndef NULL
#define NULL 0
#endif
#include<iostream>
#include<iomanip>
#include<string>
using namespace std;
struct LNode
{
    //存储数据
    int month;
    int day;
    string name;
    double price;
};
class List
{
public:
    int _size;
    LNode* arr;
    
    void init() {
        arr = new LNode[100]; // 假设最大容量为100
        
        for (int i = 0; i < 100; i++) {
            arr[i].month = -1; // 初始化月份为-1，表示该位置为空
        }
        
        _size = 0;
    }
    
    List() { init(); } // 构造函数
    
    ~List() { delete[] arr; }; // 析构函数
    
    void insert(int& a, int& b, string& c, double& d)
    {
        if (_size >= 100) return; // 容量已满
        
        _size++;
        
        int index = _size - 1;
        
        while (index > 0 && (a < arr[index - 1].month || (a == arr[index - 1].month && b < arr[index - 1].day))) {
            arr[index] = arr[index - 1];
            index--;
        }
        
        arr[index].month = a;
        arr[index].day = b;
        arr[index].name = c;
        arr[index].price = d;
    }
    
};
int main()
{
	int m, n;
	string str;
	string c;
	double d;
	List L1;
	double ave1 = 0.0;
	double ave2 = 0.0;
	cin >> m >> n;
	for (int i = 0; i < m; i++)
	{
		cin >> str >> c >> d;
		int a = stoi(str, 0, 10);
        
		if (a >= 10)
			str.erase(0, 3);
		else
			str.erase(0, 2);
		int b = stoi(str, 0, 10);
        
        L1.insert(a, b, c, d);
	}
	double sum1 = 0.0;
	int count1 = 0;
	double sum2 = 0.0;
	int count2 = 0;
	for (int i = 0; i < L1._size; i++)
	{
        if (count1 >= n && count2 >= n)
        {
            break;
        }
        if (L1.arr[i].name == "keyboard" && count1 < n)
        {
            sum1 += L1.arr[i].price;
            count1++;
        }
        
        if (L1.arr[i].name == "mouse" && count2 < n)
        {
            sum2 += L1.arr[i].price;
            count2++;
        }
    }
	cout << fixed << setprecision(1) << sum1 / n << endl;
	cout << fixed << setprecision(1) << sum2 / n << endl;
	return 0;
}