有一条n个头恶龙,m个骑士,一个能力值为x的骑士能砍掉直径不超过x的头,且需要支付x金币。砍掉所有的恶龙所有的头,且支付金币最少?
头直径和骑士能力从小到大排序,一个个砍。
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 20005;
int a[maxn];
int b[maxn];
int main()
{
int n, m;
while (cin>>n>>m && n && m)
{
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
sort(a, a + n);
sort(b, b + m);
int cur = 0;
int cost = 0;
for (int i = 0; i < m; i++)
{
if (b[i] >= a[cur])
{
cur++;
cost += b[i];
if (cur == n)
break;
}
}
if (cur < n)
cout << "Loowater is doomed!\n";
else
cout << cost << endl;
}
return 0;
}