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();
        long[] nums1 = new long[n];
        long[] nums2 = new long[n];

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

        PriorityQueue<Student> s1 = new PriorityQueue<>(Comparator.comparing(l -> l.num1 * -1));

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

        Student student = s1.poll();
        while (!s1.isEmpty()) {
            Student student1 = s1.poll();
            Student student2 = s1.poll();

            PriorityQueue<Student> s2 = new PriorityQueue<>(Comparator.comparing(l -> l.num2 * -1));

            s2.add(student1);
            if(student2 != null){
                s2.add(student2);
            }

            while (!s1.isEmpty() && student2 != null && student1.num1 == student2.num1){
                student1 = s1.poll();
                student2 = s1.poll();

                s2.add(student1);
                if(student2 != null){
                    s2.add(student2);
                }
            }

            final int size = s2.size();

            for(int i =0;i<size/2.0;i++ ){
                sum += s2.poll().num2;
            }
        }

        System.out.println(sum);
    }

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

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