以下是使用顺序表实现的代码：
#ifndef NULL
#define NULL 0
#endif
#include<iostream>
#include<iomanip>
#include<string>
using namespace std;
const int MAX_SIZE = 100; // 最大容量
struct LNode
{
//存储数据
int month;
int day;
string name;
double price;
};
class List
{
public:
int _size;
LNode elem[MAX_SIZE]; // 顺序表存储元素的数组
List() { _size = 0; } //构造函数
//头插法
void insert(int& a, int& b, string& c, double& d)
{
if (_size >= MAX_SIZE) {
cout << "List is full." << endl;
return;
}
for (int i = _size - 1; i >= 0; i--) {
elem[i + 1] = elem[i];
}
elem[0].month = a;
elem[0].day = b;
elem[0].name = c;
elem[0].price = d;
_size++;
}
void print_L()
{
for (int i = 0; i < _size; i++) {
cout << elem[i].month << " " << elem[i].day << " ";
}
cout << endl;
}
int located(int a, int b)
{
int e = 1;
for (int i = 0; i < _size; i++) {
if (a < elem[i].month) {
e++;
}
else if (a == elem[i].month && b <= elem[i].day) {
e++;
}
else if (a == elem[i].month && b > elem[i].day) {
break;
}
}
return e;
}
};
int main()
{
int m, n;
string str;
string c;
double d;
List L1;
double ave1 = 0;
double ave2 = 0;
cin >> m >> n;
for (int i = 0; i < m; i++)
{
cin >> str >> c >> d;
int a = stoi(str.substr(0, 2));
int b = stoi(str.substr(3, 2));
int e = L1.located(a, b);
L1.insert(e, a, b, c, d);
}
double sum1 = 0;
int count1 = 0;
double sum2 = 0;
int count2 = 0;
for (int i = 0; i < L1._size; i++)
{
if (count1 >= n)
{
break;
}
else
{
if (L1.elem[i].name == "keyboard")
{
sum1 += L1.elem[i].price;;
count1++;
}
}
}
for (int i = 0; i < L1._size; i++)
{
if (count2 >= n)
{
break;
}
else
{
if (L1.elem[i].name == "mouse")
{
sum2 += L1.elem[i].price;;
count2++;
}
}
}
cout << fixed << setprecision(1) << sum1 / n << endl;
cout << fixed << setprecision(1) << sum2 / n << endl;
return 0;
}
希望对你有所帮助！
内容由零声教学AI助手提供，问题来源于学员提问
