CDOJ--1020
原题链接:http://acm.uestc.edu.cn/problem.php?pid=1020
分析:按升序排序即可。
Vote
1 #include<iostream> 2 #include<cstdio> 3 #include<algorithm> 4 #include<functional> 5 using namespace std; 6 int voter[105]; 7 int main() 8 { 9 int n,ans; 10 while(scanf("%d",&n)==1) 11 { 12 if(n==0)break; 13 int i;ans=0; 14 for(i=0;i<n;i++) 15 scanf("%d",&voter[i]); 16 sort(voter,voter+n); 17 int k; 18 if(n%2!=0)k=(n-1)/2; 19 else k=n/2; 20 for(i=0;i<=k;i++) 21 ans+=voter[i]/2+1; 22 printf("%d\n",ans); 23 } 24 return 0; 25 } 26