import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;

class Codechef {
    public static void main(String[] args) throws java.lang.Exception {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] nums1 = new int[n];
        int[] nums2 = new int[n];

        for (int i = 0; i < n; i++) {
            nums1[i] = sc.nextInt();
        }
        for (int i = 0; i < n; i++) {
            nums2[i] = sc.nextInt();
        }

        PriorityQueue<Student> s1 = new PriorityQueue<>((l,r) -> l.num1 == r.num1 ? l.num2.compareTo(r.num2) * -1 : l.num1.compareTo(r.num1) * -1);
        PriorityQueue<Student> s2 = new PriorityQueue<>(Comparator.comparing(l -> -1 * l.num2));

        for (int i = 0; i < n; i++) {
            Student student = new Student(nums1[i], nums2[i]);
            s1.add(student);
            s2.add(student);
        }
        long sum = 0;

        while (!s1.isEmpty() || !s2.isEmpty()) {
            while (!s1.isEmpty()) {
                Student student = s1.poll();
                if (!student.visited) {
                    student.visited = true;
                    break;
                }
            }
            while (!s2.isEmpty()) {
                Student student = s2.poll();
                if (!student.visited) {
                    student.visited = true;
                    sum += student.num2;
                    break;
                }
            }
        }

        System.out.println(sum);

    }

    public static class Student {
        public Integer num1;
        public Integer num2;
        public Boolean visited;

        public Student(Integer num1, Integer num2) {
            visited = false;
            this.num1 = num1;
            this.num2 = num2;
        }
    }
}