1．鏈接地址

https://vjudge.net/problem/POJ-2370

2．問題描述

?In one of the countries of Caribbean basin all decisions were accepted by the simple majority of votes at the general meeting of citizens (fortunately, there were no lots of them). One of the local parties, aspiring to come to power as lawfully as possible, got its way in putting into effect some reform of the election system. The main argument was that the population of the island recently had increased and it was to longer easy to hold general meetings.?
The essence of the reform is as follows. From the moment of its coming into effect all the citizens were divided into K (may be not equal) groups. Votes on every question were to be held then in each group, moreover, the group was said to vote "for" if more than half of the group had voted "for", otherwise it was said to vote "against". After the voting in each group a number of group that had voted "for" and "against" was calculated. The answer to the question was positive if the number of groups that had voted "for" was greater than the half of the general number of groups.?
At first the inhabitants of the island accepted this system with pleasure. But when the first delights dispersed, some negative properties became obvious. It appeared that supporters of the party, that had introduced this system, could influence upon formation of groups of voters. Due to this they had an opportunity to put into effect some decisions without a majority of voters "for" it.?
Let's consider three groups of voters, containing 5, 5 and 7 persons, respectively. Then it is enough for the party to have only three supporters in each of the first two groups. So it would be able to put into effect a decision with the help of only six votes "for" instead of nine, that would .be necessary in the case of general votes.?
You are to write a program, which would determine according to the given partition of the electors the minimal number of supporters of the party, sufficient for putting into effect of any decision, with some distribution of those supporters among the groups.

輸入樣例

3 5 7 5

輸出樣例

6

3．解題思路

?先根據總的小組數算出總共需要k小組支持，再將小組按人數從少到多排列后，取k小組里一半多一個的人數之和

4．算法實現源代碼

#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> using namespace std; const int maxn=110; int a[maxn]; int main() {memset(a,0,sizeof(a));int n;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&a[i]);}int k=n/2+1;sort(a,a+n);int sum=0;for(int i=0;i<k;i++){sum+=(a[i]/2+1);}printf("%d\n",sum); }

?

轉載于:https://www.cnblogs.com/KasenBob/p/11176812.html

總結

以上是生活随笔為你收集整理的poj2370的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。