提交记录 #84

#include<stdio.h>
int main(){
    int n,m,d[100],l[100],i=0,j,cham,cha1,z,total=0,s,shibai=0;
    scanf("%d %d",&n,&m);
    while(i<n){
        scanf("%d",&d[i]);
        i++;
    }
    i = 0;
    while(i<m){
        scanf("%d",&l[i]);
        i++;
    }
    for(i=0;i<n;i++){
        cham = l[i]-d[i];
        s = i;
        for(j=i+1;j<m;j++){
            cha1 = l[j]-d[i];
            if(cha1>=0&&cha1<cham){
                cham = cha1;
                s = j;
            }
        }
        if(cham<0||n>m){
            shibai = 1;
        }
        total += l[s];
        z = l[i];
        l[i] = l[s];
        l[s] = z;
    }
    if(shibai==1){
        printf("bit is doomed!\n");
    }
    else{
        printf("%d\n",total);
    }
    return 0;
}