UVa11292

#include <cstdio.h>#include <algorithm>#define max 200001using namespace std;int head[max];int knight[max];int main(int argc, char *argv[]){int n,m;while(scanf("%d%d",&n,&m)==1&&n&&m){for(int i = 0; i <= n; i++)scanf("%d",&head[i]);for(int i = 0; i<=m; i++)scanf("%d%d",&knight[i]);sort(head,head+n);sort(knight,knight+m)int cost = 0;int h = 0;for(int i = 0; i <= m; i++){if(knight[i] >= head[h]){cost += knight[i];if(++h == n)break;}if(h <= n)printf("Loowater is doomed!\n");elseprintf("%d",cost);}}return 0;}