BJFU 210基于顺序存储结构的图书信息表的最佳位置图书的查找

#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--)
	{
        int pos;//位置
		cin >> pos;
		if (pos == 0)
			cout << "Sorry，the book on the best position doesn't exist!";
		else
		{
			cout << book[pos - 1].bookno << " " << book[pos - 1].name<<" ";
			printf("%.2lf\n", book[pos - 1].price);
		}
	}
		
}