11 URAL1025 Democracy in Danger
2015-05-02 20:44
288 查看
选择人数较少的m/2只队,每只队中半数人投票。
#include<cstdio> #include<algorithm> using namespace std; int main() { int i,n,ans,s[110]; while(~scanf("%d",&n)) { for(i=0;i<n;i++) scanf("%d",&s[i]); sort(s,s+n); ans=0; for(i=0;i<=n/2;i++) ans+=s[i]/2+1; printf("%d\n",ans); } return 0; }
相关文章推荐
- Ural 1025 Democracy in Danger 解题报告
- POJ 2370 Democracy in Danger
- Overcome ACM POJ 2370 - Democracy in danger
- ural 1025 Democracy in Danger
- poj 2370 Democracy in danger
- (贪心5.2.7)URAL 1025 Democracy in Danger
- POJ 2370 Democracy in danger(简单贪心)
- poj 2370 Democracy in danger
- POJ 2370 Democracy in danger G++
- Overcome ACM POJ 2370 - Democracy in danger
- Ural 1025 Democracy in Danger 解题报告
- URAL 1025 Democracy in Danger
- poj2370 Democracy in danger!
- POJ 2370 Democracy in danger
- URAL 1025 — Democracy in Danger
- How to Enable 64-bit Processes for Enhanced Protected Mode in Internet Explorer 11 (IE11)
- Question 11: Which of the following statements describe the result when standard new cannot allocate the requested storage in C+
- C++ 11: lexical closure in lambda function, example 1
- Top 11 Best Practices in Software Testing
- What does the 11 mean in INT(11)?