Untitled

#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>

using namespace std;

long long solve(int n, vector<int>& people, vector<int>& starting, vector<int>& ending) {
    // Prepare the meetings list as {start, end, people}
    vector<tuple<int, int, int>> meetings(n);
    for (int i = 0; i < n; ++i) {
        meetings[i] = make_tuple(starting[i], ending[i], people[i]);
    }

    // Sort meetings by their ending times
    sort(meetings.begin(), meetings.end(), [](const tuple<int, int, int>& a, const tuple<int, int, int>& b) {
        return get<1>(a) < get<1>(b);
    });

    // Total number of people
    long long total_people = 0;
    for (const auto& m : meetings) {
        total_people += get<2>(m);
    }

    // Calculate maximum number of attendees
    long long max_attendees = 0;
    int last_end_time = -1;

    for (const auto& meeting : meetings) {
        int start_time = get<0>(meeting);
        int end_time = get<1>(meeting);
        int current_people = get<2>(meeting);

        // If the current meeting starts after the last selected meeting ends
        if (start_time >= last_end_time) {
            max_attendees += current_people; // Include this meeting
            last_end_time = end_time; // Update the end time
        }
    }

    // Minimum people who cannot attend any meetings
    return total_people - max_attendees;
}

int main() {
    int N;
    cin >> N;

    vector<int> people(N);
    vector<int> starting(N);
    vector<int> ending(N);

    for (int i = 0; i < N; ++i) {
        cin >> people[i];
    }

    for (int i = 0; i < N; ++i) {
        cin >> starting[i];
    }

    for (int i = 0; i < N; ++i) {
        cin >> ending[i];
    }

    cout << solve(N, people, starting, ending) << endl;

    return 0;
}