zoj3023.cpp

最近在acm.zju.edu.cn上通过的题目的代码

#include <stdio.h>

int main(){
    int n, m;
    int a[200], b[200], sa, sb;
    int bi, bj, bs;
    while (scanf("%d%d", &n, &m) != EOF && n + m){
    	sa = sb = 0;
     	for (int i = 0; i < n; i++) {
        	scanf("%d", &a[i]);
            sa += a[i];
        }
        for (int i = 0; i < m; i++) {
        	scanf("%d", &b[i]);
            sb += b[i];
        }
    	bs = -1;
        for (int i = 0; i < n; i++)
        	for (int j = 0; j < m; j++){
            	if (sa - a[i] + b[j] == sb - b[j] + a[i]){
                	if (bs == -1 || i + j < bs){
                    	bi = i; bj = j; bs = i + j;
                    }
                }
            }
        if (bs == -1) puts("-1");
        else printf("%d %d\n", a[bi], b[bj]);
    }
    return 0;
}