Submission #69531719

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <atcoder/all>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;
typedef vector<int> Vec;

int lis(Vec a) {
    const int INF = 1e+9;
    int n = a.size(), i;
    Vec dp(n + 1, INF);

    dp[0] = -INF;
    rep(i, n) {
        int it = upper_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        dp[it] = a[i];
    }

    for (i = n; i >= 0; i--) if (dp[i] < INF) break;
    return i;
}

signed main() {
    int i, n;
    cin >> n;
    Vec p(n), c(n);
    rep(i, n) cin >> p[i];
    rep(i, n) cin >> c[i];

    map<int, Vec> mp;
    rep(i, n) {
        mp[c[i]].push_back(p[i]);
    }

    int ans = 0;
    for (map<int, Vec>::iterator it = mp.begin(); it != mp.end(); it++) {
        Vec vec = it->second;
        int cnt = (int)vec.size() - lis(vec);
        ans += it->first * cnt;
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result