poj2860

简单题

View Code

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
using namespace std;

#define maxn 20

int n, m, k;
int f[maxn], g[maxn];

void input()
{
    scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < k; i++)
        scanf("%d", &f[i]);
for (int i = 0; i < k; i++)
        scanf("%d", &g[i]);
}

void work()
{
int ans = 0;
for (int i = 0; i < k; i++)
if (f[i] > g[i])
            ans += f[i] - g[i];
    printf("%d\n", ans);
}

int main()
{
//freopen("t.txt", "r", stdin);
    input();
    work();
return 0;
}

转载于:https://www.cnblogs.com/rainydays/archive/2011/10/06/2199780.html