BJFU 206 基于顺序存储结构的图书信息表的修改

## 图书信息的题目利用单链表 修改十分麻烦 ，优先考虑数组
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <queue>
using namespace std;

struct Book {
	string bookno;
	string name;
	double price;
};

int main() {
	int n;
	string bookno;//编号
	string name; //名字
	double price; //价格

	Book book[100];
	int k = 0;
	while (cin >> bookno >> name >> price)
	{
		if (bookno == "0" && name == "0"&&price == 0) break;
		book[k].bookno = bookno;
		book[k].name = name;
		book[k].price = price;
		k++;  //书的数量 
	}
	double sum = 0; double pj;
	
	//平均价格
	for (int i = 0; i < k; i++) {   
		
		sum = sum + book[i].price;
	}
	pj = sum / k;
	printf("%.2lf\n", pj);
	
	//修改
	for (int i = 0; i < k; i++) {
		if (book[i].price < pj) {
			book[i].price = book[i].price*1.2;
		}
		else if (book[i].price >= pj) {
			book[i].price = book[i].price*1.1;
		}
	}

    //输出 
	for (int i = 0; i < k; i++) {  
		cout << book[i].bookno;	  printf(" ");
		cout << book[i].name;     printf(" ");
		printf("%.2lf\n", book[i].price);   
	}



}