#include <stdio.h>
#include <stdlib.h>

typedef struct {
    int growTime;
    int plantTime;
} Seed;

int compareSeed(const void* a, const void* b) {
    Seed* seedA = (Seed*)a;
    Seed* seedB = (Seed*)b;
    return seedB->growTime - seedA->growTime; // Descending order
}

int earliestFullBloom(int* plantTime, int* growTime, int n) {
    Seed* seeds = (Seed*)malloc(n * sizeof(Seed));
    
    for (int i = 0; i < n; i++) {
        seeds[i].growTime = growTime[i];
        seeds[i].plantTime = plantTime[i];
    }
    
    qsort(seeds, n, sizeof(Seed), compareSeed);
    
    int currentPlantDay = 0;
    int maxBloomDay = 0;
    
    for (int i = 0; i < n; i++) {
        currentPlantDay += seeds[i].plantTime;
        int bloomDay = currentPlantDay + seeds[i].growTime;
        if (bloomDay > maxBloomDay) {
            maxBloomDay = bloomDay;
        }
    }
    
    free(seeds);
    return maxBloomDay;
}

int main() {
    int n;
    scanf("%d", &n);
    
    int* plantTime = (int*)malloc(n * sizeof(int));
    int* growTime = (int*)malloc(n * sizeof(int));
    
    for (int i = 0; i < n; i++) {
        scanf("%d", &plantTime[i]);
    }
    
    for (int i = 0; i < n; i++) {
        scanf("%d", &growTime[i]);
    }
    
    printf("%d\n", earliestFullBloom(plantTime, growTime, n));
    
    free(plantTime);
    free(growTime);
    return 0;
}