BJFU 209基于顺序存储结构的图书信息表的最爱图书的查找

#include<bits/stdc++.h>
using namespace std;

struct Book {
	string bookno;
	char name[100];
	double price;
};

int main() {
	Book book[1000];

	int n;
	cin >> n;//信息个数 

	//书库 
	for (int i = 0; i < n; i++) {
		cin >> book[i].bookno;
		cin >> book[i].name;
		cin >> book[i].price;
	}

	//最爱图书
	int m;
	cin >> m;
	
	while (m>0)
	{
		int count = 0;

		string fav;
		cin >> fav; //图书1

		for (int i = 0; i < n; i++) {
			if (fav == book[i].name) {
				count++;
			}
		}
		if (count == 0)  //无对应图书
			cout<<"Sorry，there is no your favourite!\n";
		
		else  //有对应图书
		{
			printf("%d\n", count);   //数量
			for (int i = 0; i < n; i++) {  //图书信息
				if (fav == book[i].name) {
					cout << book[i].bookno << " " << book[i].name << " ";
					printf("%.2lf\n", book[i].price);
				}
			}
			
		}
		            m--;
	}

}