18.1.11A勇者斗恶龙

原码：

#include <iostream>
#include<algorithm>

using namespace std;

int main()
{
    int m,n,sum=0;
    int i , j;
    cin>>m>>n;
    if(m>n)
        cout<<"Loowater is doomed!"<<endl;
    int A[m],B[n];
    for(i=0;i<m;i++)
        cin>>A[i];
    for(j=0;j<n;j++) 
        cin>>B[j];
    sort(A,A+m);
    sort(B,B+n);
    for(i=0,j=0;i<n,j<m;){
        if(B[i]<A[0]) i++;
        else {sum=sum+B[i];
        i++;
        j++;}
#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;
}



答案：

#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;
}




} cout << sum << endl; return 0;}

/*while 循环表示输入一组数*/
代码杂乱无章，并且无法实现输入多组数据的目的；
标记 i , j 不明显，可读性差。