CF 1020C Elections

题目传送门：https://codeforces.com/problemset/problem/1020/C

C. Elections

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

As you know, majority of students and teachers of Summer Informatics School live in Berland for the most part of the year. Since corruption there is quite widespread, the following story is not uncommon.

Elections are coming. You know the number of voters and the number of parties — nn and mm respectively. For each voter you know the party he is going to vote for. However, he can easily change his vote given a certain amount of money. In particular, if you give ii-th voter cicibytecoins you can ask him to vote for any other party you choose.

The United Party of Berland has decided to perform a statistical study — you need to calculate the minimum number of bytecoins the Party needs to spend to ensure its victory. In order for a party to win the elections, it needs to receive strictly more votes than any other party.

Input

The first line of input contains two integers nn and mm (1≤n,m≤30001≤n,m≤3000) — the number of voters and the number of parties respectively.

Each of the following nn lines contains two integers pipi and cici (1≤pi≤m1≤pi≤m, 1≤ci≤1091≤ci≤109) — the index of this voter's preferred party and the number of bytecoins needed for him to reconsider his decision.

The United Party of Berland has the index 11.

Output

Print a single number — the minimum number of bytecoins needed for The United Party of Berland to win the elections.

Examples

input

Copy

1 2
1 100

output

Copy

0

input

Copy

5 5
2 100
3 200
4 300
5 400
5 900

output

Copy

500

input

Copy

5 5
2 100
3 200
4 300
5 800
5 900

output

Copy

600

Note

In the first sample, The United Party wins the elections even without buying extra votes.

In the second sample, The United Party can buy the votes of the first and the fourth voter. This way The Party gets two votes, while parties 33, 44 and 55 get one vote and party number 22 gets no votes.

In the third sample, The United Party can buy the votes of the first three voters and win, getting three votes against two votes of the fifth party.

一个学弟给我做的题，还是蛮好的。

大致题意：我们有n个人投票，下面的p[i]和c[i]分别代表的是第i个人投票的人选编号以及你贿赂这个人，让他给你投票需要的花费，你是1号选手，要想获得投票的胜利，最少需要的花费是多少？（这里的票数要严格大于所有人）

n只有3000，n^2的做法肯定可以的，首先想到的是贪心，但是相关联的情况太多了，直接贪心可能解决不了（我写了一下，写拉闸了，就不再想了）

首先把除了1以外所有的投票人放在结构体里，排序。

换个思路，可以直接枚举我们获得投票胜利的票数，假设为x，然后对于每个可以胜利的情况，我们可以倒着遍历，从花费最大的开始，记录每次出现的人当选的票数，如果当前的人选举的人的票数大于x-1了，证明他是对我们造成威胁的，所以开始对于这个人开始标记，并且开始贿赂他，接着再从小到大遍历一次，因为在前面一步，我们已经把所有对我们构造威胁的人都贿赂改票了，那现在只需要加到符合我的x即可，每次选择花费最少的来算进价值里。

每次枚举的时候，再取个min。

还有一些细节处理的地方，大家可以仔细想想，并不难。

代码如下：

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n,m;
struct node {
    int x,y;
} g[3999];
bool cmp(struct node a,struct node  b) {
    return a.y < b.y;
}
int x,y;
int vis[3200];
int vis1[3200];
vector<struct node>v;
int main() {
    while(cin >> n >> m) {
        v.clear();
        int cur = 0;
        for(int i = 1; i <= n; i++) {
            cin >> x >> y;
            struct node gg = node {
                x,y
            };
            if(x != 1) v.push_back(gg);
            else cur++;
        }
        sort(v.begin(),v.end(),cmp);
        ll ans = 1e18;
        for(int i = cur; i <= n; i++) {
            int x = i;
            memset(vis1,0,sizeof(vis1));
            memset(vis,0,sizeof(vis));
            ll sum = 0;
            int num = cur;
            for(int j = v.size() - 1; j >= 0; j--) {
                struct node gg = v[j];
                int id = gg.x;
                int c = gg.y;
                vis1[id]++;
                if(vis1[id] > x - 1) vis[j] = 1,vis1[id]--,sum += c,num++;
            }
            for(int j = 0; j < v.size() && num < i ; j++) {
                if(!vis[j]) {
                    sum += v[j].y;
                    num++;
                }
                if(num >= i) {
                    goto kkk;
                }
            }
            if(num >= i) {
kkk:
//                cout << i <<endl;
                ans = min(ans,sum);
            }
//            cout << sum << "   " << num << endl;
        }
        cout << ans << endl;
    }
    return 0;
}