枚举票数,如果比当前票数大就收买,之后再遍历一遍,如果超过当前的枚举就结束(比如你现在枚举到2,当前3票的人有三个,直接判断答案),不足当前枚举的票数就补上。
//以为枚举的票数就是实际的票数,其实可能不止。。。。枚举的票数其实感觉更像是枚举层数,遍历全部总会遍历到临界点
(唉,这种题做的还是少了,看了别人之后才知道怎么枚举)
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<math.h>
#include<map>
using namespace std;
#define LL long long
#define N 3010
int vis[N], f[N];
struct node
{
LL p, c;
}w[N];
bool cmp(node a, node b)
{
return a.c < b.c;
}
int sum[N];
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf("%lld%lld", &w[i].p, &w[i].c);
sum[w[i].p]++;
}
sort(w + 1, w + n + 1, cmp);
int k, n1 = n / 2 + 1, peo;
LL ans = 1e15, c;
for (int i = 0; i <= n1; i++)
{
k = sum[1];
c = 0;
memset(vis, 0, sizeof(vis));
memset(f, 0, sizeof(f));
for (int j = 1; j <= n; j++)
{
peo = w[j].p;
if (peo == 1)
{
vis[j] = 1;
continue;
}
if (sum[peo] - f[peo] > i)
{
vis[j] = 1;
f[peo]++;
k++;
c += w[j].c;
}
}
for (int j = 1; j <= n; j++)
{
if (k > i)break;
if (!vis[j])c += w[j].c, k++;
}
ans = min(ans, c);
}
cout << ans << endl;
return 0;
}