# Codeforces 557C Arthur and Table

Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable.

In total the table Arthur bought has n legs, the length of the i-th leg is li.

Arthur decided to make the table stable and remove some legs. For each of them Arthur determined number di — the amount of energy that he spends to remove the i-th leg.

A table with k legs is assumed to be stable if there are more than half legs of the maximum length. For example, to make a table with 5 legs stable, you need to make sure it has at least three (out of these five) legs of the maximum length. Also, a table with one leg is always stable and a table with two legs is stable if and only if they have the same lengths.

Your task is to help Arthur and count the minimum number of energy units Arthur should spend on making the table stable.

Input
The first line of the input contains integer n (1 ≤ n ≤ 105) — the initial number of legs in the table Arthur bought.

The second line of the input contains a sequence of n integers li (1 ≤ li ≤ 105), where li is equal to the length of the i-th leg of the table.

The third line of the input contains a sequence of n integers di (1 ≤ di ≤ 200), where di is the number of energy units that Arthur spends on removing the i-th leg off the table.

Output
Print a single integer — the minimum number of energy units that Arthur needs to spend in order to make the table stable.

Sample test(s)
input
2
1 5
3 2
output
2
input
3
2 4 4
1 1 1
output
0
input
6
2 2 1 1 3 3
4 3 5 5 2 1
output
8

#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <array>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 100010;
vector<int> vec[maxn];
priority_queue<int, vector<int>, less<int> > pq;
int l[maxn], d[maxn], sum[maxn];
vector<int> vv;

int main() {

//freopen("aa.in", "r", stdin);

int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%d", &l[i]);
}
int tot = 0;
int ans = 0x3f3f3f3f;
for(int i = 1; i <= n; ++i) {
scanf("%d", &d[i]);
tot += d[i];
vec[l[i]].push_back(d[i]);
sum[l[i]] += d[i];
}
for(int i = 1; i <= 100000; ++i) {
if(sum[i] == 0) continue;
int t = sum[i];
int s = vec[i].size() - 1;
vv.clear();
int tt = 0;
while(s > 0 && !pq.empty()) {
tt += pq.top();
vv.push_back(pq.top());
pq.pop();
s--;
}
t += tt;
ans = min(ans, tot - t);
for(int j = 0; j < (int)vv.size(); ++j) {
pq.push(vv[j]);
}
for(int j = 0; j < (int)vec[i].size(); ++j) {
pq.push(vec[i][j]);
}
}
printf("%d\n", ans);
return 0;
}


#### codeforces 557c Arthur and Table

2015-07-10 09:23:28

#### （CodeForces - 557C）Arthur and Table

2017-09-13 11:08:45

#### CodeForces 557C Arthur and Table

2015-07-01 22:10:20

#### Codeforces 557C Arthur and Table【思维】

2017-03-04 11:44:26

#### 【codeforces 557C Arthur and Table】+ 思维

2016-12-07 23:24:40

#### Problem - 557C - Codeforces - Arthur and Table

2017-08-06 10:36:49

#### 557C - Arthur and Table （前缀和）

2015-07-26 13:35:22

#### 557C Arthur and Table

2015-07-21 10:34:10

#### codeforces 508E E. Arthur and Brackets(栈模拟+贪心+构造)

2015-08-17 20:08:23