题目:
有n个人排队到r个水龙头去打水,他们装满水桶的时间t1、t2…………tn为整数且各不相等,应如何安排他们的打水顺序才能使他们总共花费的时间最少?
数据规模和约定
其中80%的数据保证n< =10
输入
第一行n,r (n< =500,r< =75)
第二行为n个人打水所用的时间Ti (Ti< =100);
输出
最少的花费时间
#include <iostream>
#include <algorithm>
using namespace std;
int pnext, people, runner, ans = 0, time[10] = {0};
int op() //直接模拟排队过程
{
for (;;)
{
for (int i = 1; i <= runner; i++)
{
time[i] -= 1, ans += 1;
if (time[i] == 0)
{
time[i] = time[pnext], time[pnext] = 0, people -= 1, pnext += 1;
if (time[pnext] == 0)
{
ans = ans + (people + 1 - runner);
return 0;
}
}
}
}
}
int main()
{
cin >> people >> runner;
pnext = runner + 1;
for (int i = 1; i <= people; i++)
cin >> time[i];
int t = op();
sort(time, time + people);
for (int i = 1; i <= 9; i++)
ans = ans + time[i];
cout << ans << endl;
return 0;
}