数据结构实验一,第2题:基于顺序存储结构的图书信息表的排序

描述

定义一个包含图书信息(书号、书名、价格)的顺序表,读入相应的图书数据完成图书信息表的创建,然后将图书按照价格降序排序,逐行输出排序后每本图书的信息。

输入

输入n+1行,前n行是n本图书的信息(书号、书名、价格),每本图书信息占一行,书号、书名、价格用空格分隔,价格之后没有空格。最后第n+1行是输入结束标志:0 0 0(空格分隔的三个0)。其中书号和书名为字符串类型,价格为浮点数类型。

输出

总计n行,每行是一本图书的信息(书号、书名、价格),书号、书名、价格用空格分隔。其中价格输出保留两位小数。

输入样例 1

9787302257646 Data-Structure 35.00
9787302164340 Operating-System 50.00
9787302219972 Software-Engineer 32.00
9787302203513 Database-Principles 36.00
9787810827430 Discrete-Mathematics 36.00
9787302257800 Data-Structure 62.00
9787811234923 Compiler-Principles 62.00
9787822234110 The-C-Programming-Language 38.00
0 0 0

输出样例 1

9787302257800 Data-Structure 62.00
9787811234923 Compiler-Principles 62.00
9787302164340 Operating-System 50.00
9787822234110 The-C-Programming-Language 38.00
9787302203513 Database-Principles 36.00
9787810827430 Discrete-Mathematics 36.00
9787302257646 Data-Structure 35.00
9787302219972 Software-Engineer 32.00

代码

#include <bits/stdc++.h>
#define Maxsize 1000 
using namespace std;
struct Book{
	string ISBN;
	string Name;
	double Price;
};

int main()
{
	int i=0;
	struct Book book[Maxsize];
	while(1)
	{
		cin>>book[i].ISBN>>book[i].Name>>book[i].Price;
		if(book[i].ISBN=="0"&&book[i].Name=="0"&&book[i].Price==0)
		    break;
		++i;
	}
	struct Book bookcmp;
	for(int a=0;a<i-1;a++)
	{
		for(int b=a+1;b<i;b++)
		{
			if(book[a].Price<book[b].Price)
			{
				bookcmp=book[a];
				book[a]=book[b];
				book[b]=bookcmp;
			}
			if(book[a].Price==book[b].Price)
			{
				if(book[a].ISBN>book[b].ISBN)
				{
					bookcmp=book[a];
				book[a]=book[b];
				book[b]=bookcmp;
					
				}
			}
		}
	 } 
	for(int j=0;j<i;j++)
	    cout<<book[j].ISBN<<" "<<book[j].Name<<" "<<fixed<<setprecision(2)<<book[j].Price<<endl;
	return 0;
}

版权声明:本文为Cznwtl原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。