zoj 3023 Equal Total Scores

这道题题意很简单,水题一道,就是说两个人手里有张数未必相同的扑克牌,问,能否通过两人交换一张牌来实现两人手中的牌的和相等,如果可以输出这两张牌,不可以则输出-1

值得注意的是,如果交换之前两人手中的牌的和已经相等,扔需经过一次交换.

比较简单,代码就不写注释了  其实,其实,我也不想只刷水题,只是,只是....

#include <stdio.h> #define INT_MAX 20000 int main(void) { int n,m,status,i,j,score_1,score_2,sum; int a[250],b[250]; while (scanf("%d %d",&n,&m) && n) { int sum_1 = 0,sum_2 = 0,flag = 0; for (i=0;i<n;i++) { scanf("%d",&a[i]); sum_1 += a[i]; } for (i=0;i<m;i++) { scanf("%d",&b[i]); sum_2 += b[i]; } sum = sum_1 + sum_2; if (sum%2) { printf("-1/n"); continue; } sum /= 2; status = sum-sum_1; sum = INT_MAX;score_1=0;score_2 = 0; for (i=0;i<n;i++) for (j=0;j<m;j++) if (a[i] + status == b[j]) { flag = 1; if (sum > a[i] + b[j]) { sum = a[i] + b[j]; score_1 = i; score_2 = j; } } if (flag) printf("%d %d/n",a[score_1],b[score_2]); else printf("-1/n"); } return 0; }