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

#define _CRT_SECRUE_NO_WARNINGS
#include <iostream>
#include <string>
using namespace std;

struct Book {
	string bookno;
	string name;
	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;
	}

	//找最贵图书 
	Book Mb[200]; //存储最贵图书
	double mp = book[0].price; //最高价 

	for (int i = 0; i < n; i++) {
		if (book[i].price >= mp) {
			mp = book[i].price;
		}
	}
	//计数
	int count = 0;
	for (int i = 0; i < n; i++) {
		if (book[i].price == mp) {
			count++;
		}
	}
	printf("%d\n", count);
	//输出
	for (int i = 0; i < n; i++) {
		if (book[i].price == mp) {
			cout << book[i].bookno << " ";
			cout << book[i].name << " ";
			printf("%.2lf\n", book[i].price);
		}
	}

}