import java.util.*;
import java.math.*;
import java.io.*;


public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
} import java.util.*; util.* java import java.math.*; math.* java import java.io.*; io.* java public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
} Main public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] v = new int[n]; v new int[n] n int[] c = new int[n]; c new int[n] n for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            v[i] = sc.nextInt();
        } {
            v[i] = sc.nextInt();
        } v[i] = sc.nextInt() v[i] v i sc.nextInt() sc.nextInt sc int ans = 0; ans 0 for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            c[i] = sc.nextInt();
        } {
            c[i] = sc.nextInt();
        } c[i] = sc.nextInt() c[i] c i sc.nextInt() sc.nextInt sc boolean[] use = new boolean[n]; use new boolean[n] n while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        } true {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        } int id = -1; id -1 1 int max = 0; max 0 for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            } {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            } if(use[i]) continue; use[i] use i continue; if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                } max < v[i] - c[i] max v[i] - c[i] v[i] v i c[i] c i {
                    max = v[i] - c[i];
                    id = i;
                } max = v[i] - c[i] max v[i] - c[i] v[i] v i c[i] c i id = i id i if(id == -1) break; id == -1 id -1 1 break; use[id] = true use[id] use id true ans += max ans max System.out.println(ans) System.out.println System.out System System.out ans String args[] args public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
} public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
} Main
import java.util.*;
import java.math.*;
import java.io.*;


public class Main {
    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] v = new int[n];
        int[] c = new int[n];
        for(int i = 0; i < n; i++) {
            v[i] = sc.nextInt();
        }
        int ans = 0;
        for(int i = 0; i < n; i++) {
            c[i] = sc.nextInt();
        }

        boolean[] use = new boolean[n];


        while(true) {
            int id = -1;
            int max = 0;
            for(int i = 0; i < n; i++) {
                if(use[i]) continue;
                if(max < v[i] - c[i]) {
                    max = v[i] - c[i];
                    id = i;
                }
            }
            if(id == -1) break;
            use[id] = true;
            ans += max;
        }
        System.out.println(ans);




    } 
}