#include #include #include #include #define rep(i,n) for(int i=0; i<(int)(n); i++) using namespace std; int main(){ int N; cin >> N; assert(N>=1 && N<=10); vector a(N), b(N); rep(i,N){ int A; cin >> A; assert(A>=1 && A<=1e8); a[i]=A; } rep(i,N){ int B; cin >> B; assert(B>=1 && B<=1e8); b[i]=B; } int a_size=a.size(), b_size=b.size(); assert(a_size==N && b_size==N); vector p(N); rep(i,N) p[i]=i; int ans=0; do{ int res=0; rep(i,N) if(a[p[i]]>b[i]) res+=a[p[i]]-b[i]; ans=max(ans,res); }while (next_permutation(p.begin(),p.end())); cout << ans << endl; return 0; }