uva 11292

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

dreams_fly_oyzx

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

阅读量203

点赞数 1

分类专栏： uva(含LA)

本文链接：https://blog.youkuaiyun.com/dreams_fly_oyzx/article/details/51434249

版权

uva(含LA) 专栏收录该内容

18 篇文章

订阅专栏

uva 11292

简单的贪心

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>

using namespace std;

#define MAXNM (20000+5)

int dra[MAXNM], per[MAXNM];

int main(){
    int n, m;
    
    while(scanf("%d%d", &n, &m) && (n+m)){
        for(int i = 1; i <= n; i++) scanf("%d", &dra[i]);
        for(int i = 1; i <= m; i++) scanf("%d", &per[i]);
        
        if(n > m){
             printf("Loowater is doomed!\n");
             continue;
        }
        
        sort(dra+1, dra+n+1);
        sort(per+1, per+m+1);
        
        int db = 1, pb = 1, ans = 0;
        while(pb <= m && db <= n){
            if(dra[db] <= per[pb]){
                ans += per[pb];
                db++; pb++;
                continue;
            }
            
            pb++;
        }
        
        if(db > n) printf("%d\n", ans);
        else printf("Loowater is doomed!\n");
    }
    
    return 0;
}