ABC_125 - B - Resale

#include <bits/stdc++.h>

#define forn(l, r) for(int i = l; i < (r); ++i)
#define forj(l, r) for(int j = l; j < (r); ++j)
#define TAM 1000100
#define SYNC ios::sync_with_stdio(0);
#define $ << ' ' <<
#define F first
#define S second
#define endl '\n'


using namespace std;

using ll = long long int;
using ii = pair<int, int>;
using vii = vector<ii>;
using vi = vector<int>;
using graph = vector<vi>;
const int INF = 0x3f3f3f3f;
const int MAXN = 112345;
const ll mod = 1000000007;


int main() {
    //SYNC
    int n, ans = 0;
    vector<int> gems, cost;
    cin >> n;
    gems.assign(n, 0);
    cost.assign(n, 0);
    for (auto &k : gems) {
        cin >> k;
    }
    for (auto &j : cost) {
        cin >> j;
    }
    for (int i = 0; i < n; ++i) {
        if (gems[i] > cost[i]) {
            ans += gems[i] - cost[i];
        }
    }
    //cout << gems[0] << ' ' << cost[0] << endl;
    cout << ans << endl;

    return 0;
}