CF1267E Elections 题解

CF1267E Elections 题解

题目描述

有 $n(n\le 100)$ 个人，$m(m\le 100)$个投票站,每个投票站对每个人都有一定的票数$(\le 1000)$.
第 $n$ 个是坏蛋,请问去除掉哪几个投票站才能使他的票数不大于其他每个人中的一个，也就是不能让第 $n$ 个人的总票数最多。

输入格式

第一行是两个整数，分别是 $n$ 和 $m$。
接下来 $m$ 行 $n$ 列，代表每个投票站对这 $n$ 个人的票数。

输出格式

第一行一个整数 $k$，代表需要去掉几个投票站。
第二行有 $k$ 个数，代表投票站的号数，不要求字典序.

题目描述

Byteburg Senate elections are coming. Usually “United Byteland”, the ruling Byteland party, takes all the seats in the Senate to ensure stability and sustainable development. But this year there is one opposition candidate in one of the constituencies. Even one opposition member can disturb the stability in the Senate, so the head of the Party asks you to ensure that the opposition candidate will not be elected.

There are $n$ candidates, numbered from $1$ to $n$ . Candidate $n$ is the opposition candidate. There are $m$ polling stations in the constituency, numbered from $1$ to $m$ . You know the number of votes cast for each candidate at each polling station. The only thing you can do to prevent the election of the opposition candidate is to cancel the election results at some polling stations. The opposition candidate will be elected if the sum of the votes cast in their favor at all non-canceled stations will be strictly greater than the analogous sum for every other candidate.

Your task is to prevent the election of the opposition candidate by canceling the election results at the minimal possible number of polling stations. Notice that solution always exists, because if you cancel the elections at all polling stations, the number of votes for each candidate will be $0$, and the opposition candidate will not be elected.

输入格式

The first line of the input contains two integers $n$ and $m$ ( $2\le n\le 100$ ; $1\le m\le 100$ ) — the number of candidates and the number of polling stations. The next $m$ lines contain the election results at each polling station with $n$ numbers on each line. In the $i$ -th line the $j$ -th number is $a_{i,j}$ — the number of votes cast for the candidate j$ at the station $i$ ( $0\le a_{i,j}\le 1000$ ).

输出格式

In the first line output integer $k$ — the minimal number of the polling stations in which you need to cancel the election results. In the second line output $k$ integers — the indices of canceled polling stations, in any order. If there are multiple ways to cancel results at $k$ stations, output any one of them.

样例 #1

样例输入 #1

5 3
6 3 4 2 8
3 7 5 6 7
5 2 4 7 9

样例输出 #1

2
3 1

样例 #2

样例输入 #2

2 1
1 1

样例输出 #2

0

样例 #3

样例输入 #3

3 3
2 3 8
4 2 9
3 1 7

样例输出 #3

3
1 2 3

提示

In the first example, the candidates from $1$ to $5$ received $14,12,13,15$ and $24$ votes correspondingly. The opposition candidate has the most votes. However, if you cancel the election results at the first and the third polling stations, then only the result from the second polling station remains and the vote sums become $3,7,5,6$ and $7$, without the opposition candidate being in the lead anymore.

算法：贪心

先枚举第 $x$ 位为最终票数超过反叛者的人，然后计算反叛者与第 $x$ 位在每轮投票中票数之差，再从大到小排序。之后贪心地取差的最大值，将第 $x$ 位与反叛者票数的差距逐渐缩小，更新答案即可。

代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=110;
ll n,m,a[N][N],ans=LONG_LONG_MAX,t,p2[N],ct,p[N];
struct Vote{
	ll v,id;
}a2[N];
bool cmp(Vote l,Vote r){
	return l.v>r.v;//按差从大到小排序 
}
ll solve(ll x){
	t=ct=0;
	for(ll i=1;i<=m;i++) a2[i].v=a[i][n]-a[i][x],t+=a2[i].v,a2[i].id=i;
	//数组a2存的是反叛者与第x个人每轮中的票数之差
	//id用来存放投票站编号 
	sort(a2+1,a2+m+1,cmp);//排序 
	while(t>0) t-=a2[++ct].v,p2[ct]=a2[ct].id;//贪心取差的最大值 
	return ct;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++) cin>>a[i][j];
	for(int i=1;i<n;i++){//枚举哪个人票数超过反叛者 
		t=solve(i);
		if(t<ans){
			ans=t;
			for(int j=1;j<=ans;j++) p[j]=p2[j];
			//更新答案 
		}
	}		
	cout<<ans<<"\n";
	for(int i=1;i<=ans;i++) cout<<p[i]<<" ";
	return 0;
}