![](https://i-blog.csdnimg.cn/direct/f51b121dafa1424d882713a663b0944a.png)
代码:
cpp
//
// Created by LWJ on 2024-11-07 9:01.
//
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
// 输入顾客数量和每个顾客的服务时间:
int n;
cout << "请输入顾客数量:";
cin >> n;
vector<int> ti(n);
cout << "请输入每个顾客的服务时间:";
for (int i = 0; i < n; ++i) {
cin >> ti[i];
}
// 按照服务时间从小到大排序
sort(ti.begin(), ti.end());
// 等待时间问题按照活动用时的顺序为:
cout << "等待时间问题按照活动用时的顺序为:" << endl;
for (int i = 0; i < n; ++i) {
cout << ti[i] << " ";
}
cout << endl;
int t = 0;
int current_time = 0;
for (int i = 0; i < n; ++i) {
t += current_time;
current_time += ti[i];
}
cout << "最优服务次序下的总的等待时间为:" << endl;
cout << t << endl;
return 0;
}
运行截图:
![](https://i-blog.csdnimg.cn/direct/5275c0a01f4544c8b98a88b51ea41287.png)