#include<iostream> #include<string> //头文件 using namespace std ; /* 请在这里填写答案 */ #include<algorithm> using namespace std; class Book{ private: string ID; string name; int num; public: Book(string v1="000",string v2="book",int v3=0){ ID=v1; name=v2; num=v3; } void setID(string v1){ ID=v1; } void setName(string v2){ name=v2; } void setNum(int v3){ num=v3; } string getID(){ return ID; } string getName(){ return name; } int getNum(){ return num; } void display()const{ cout<<ID<<"-"<<name<<"-"<<num; } }; void in(Book book[],int n){ for(int i=0,i<n,i++){ cin>>book[i].ID>>book[i].name>>book[i].num; } } int findMin(Book book[],int n){ sort(book[0].num,book[n-1].num); return book[0].num; } void outmin(Book book[],int n,int minNum){ for(int i=0,i<n,i++){ if(book[i].num=book[0].num) cout<<book[i].ID<<"-"<<book[i].name<<"-"<<book[i].num; } } int main(void) { Book book[4] ; int minNum=0; in(book,4); minNum=findMin(book,4); outmin(book,4,minNum); return 0 ; } /* 请在这里填写答案 */
时间: 2024-03-10 10:47:22 浏览: 25
题目描述:给定一个 Book 类,包含 ID、name、num 三个属性,分别代表编号、名称和数量。实现以下三个函数:
1. void in(Book book[],int n),输入 n 本书的信息,存储在 book 数组中。
2. int findMin(Book book[],int n),返回 book 数组中 num 最小的书的数量。
3. void outmin(Book book[],int n,int minNum),输出 book 数组中所有数量为 minNum 的书的信息。
代码实现如下:
```c++
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
class Book{
private:
string ID;
string name;
int num;
public:
Book(string v1="000",string v2="book",int v3=0){
ID=v1;
name=v2;
num=v3;
}
void setID(string v1){
ID=v1;
}
void setName(string v2){
name=v2;
}
void setNum(int v3){
num=v3;
}
string getID(){
return ID;
}
string getName(){
return name;
}
int getNum(){
return num;
}
void display()const{
cout<<ID<<"-"<<name<<"-"<<num;
}
};
void in(Book book[],int n){
for(int i=0;i<n;i++){
cin>>book[i].ID>>book[i].name>>book[i].num;
}
}
int findMin(Book book[],int n){
sort(book,book+n,[](const Book &a, const Book &b){
return a.getNum() < b.getNum();
});
return book[0].getNum();
}
void outmin(Book book[],int n,int minNum){
for(int i=0;i<n;i++){
if(book[i].getNum() == minNum)
cout<<book[i].getID()<<"-"<<book[i].getName()<<"-"<<book[i].getNum()<<endl;
}
}
int main(void) {
Book book[4] ;
int minNum=0;
in(book,4);
minNum=findMin(book,4);
outmin(book,4,minNum);
return 0 ;
}
```
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)