Uva-11292-勇者斗恶龙

/*
十分简单，设置俩个数组，然后都从下到大排序一一对应就可以。
*/

# include <iostream>
# include <numeric>
# include <algorithm>
# include <functional>
# include <list>
# include <map>
# include <set>
# include <stack>
# include <deque>
# include <queue>
# include <vector>
# include <ctime>
# include <cstdlib>
# include <cmath>
# include <string>
# include <cstring>
# include <iomanip>

using namespace std;

int main(int argc, char *argv[])
{
	int n, m;
	while(cin >> n >> m && n != m != 0)
	{
		vector<int> a, b;
		for(int i = 0; i < n; i++)
		{
			int x;
			cin >> x;
			a.push_back(x);
		}

		for(int i = 0; i < m; i++)
		{
			int x;
			cin >> x;
			b.push_back(x);
		}

		sort(a.begin(), a.end(), less<int>());
		sort(b.begin(), b.end(), less<int>());
		int flag = 0;
		int sum = 0;
		int t = 0;
		for(int i = 0; i < b.size(); i++)
		{
			if(b[i] >= a[flag])
			{
				sum += b[i];
				flag++;
			}
			if(flag == a.size())
			{
				t = 1;
				break;
			}
		}
		if(t)
		{
			cout << sum << endl;
		}
		else
		{
			cout << "Loowater is doomed!" << endl;
		}

	}
    return 0;
}