The Dragon of Loowater, UVa 11292

最新推荐文章于 2023-04-15 19:00:26 发布

iDTer

最新推荐文章于 2023-04-15 19:00:26 发布

阅读量205

点赞数

分类专栏：算法竞赛入门经典

本文链接：https://blog.csdn.net/iDTer/article/details/79758419

版权

算法竞赛入门经典专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<algorithm>
using namespace std;

const int maxn = 20000 + 5;
int A[maxn], B[maxn];
int main(){
    int n, m;
    while(scanf("%d%d", &n, &m) == 2 && n && m){
        for(int i = 0; i < n; i++){
            scanf("%d", &A[i]);
        }
        for(int i = 0; i < m; i++){
            scanf("%d", &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]){
                cost += B[i];
                if(++cur == n) break;
            }
        }
        if(cur < n) {
            printf("Loowater is doomed!\n");
        }
        else printf("%d\n", cost);  
    }
    return 0;

}