# lightOJ 1148 - Mad Counting 【水题】

119人阅读 评论(0)

 Time Limit: 0.5 second(s) Memory Limit: 32 MB

Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population of the town. Now the naive approach to this problem will be counting people one by one. But as we all know Mob is a bit lazy, so he is finding some other approach so that the time will be minimized. Suddenly he found a poll result of that town where N people were asked "How many people in this town other than yourself support the same team as you in the FIFA world CUP 2010?" Now Mob wants to know if he can find the minimum possible population of the town from this statistics. Note that no people were asked the question more than once.

# Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with an integer N (1 ≤ N ≤ 50). The next line will contain N integers denoting the replies (0 to 106) of the people.

# Output

For each case, print the case number and the minimum possible population of the town.

# Output for Sample Input

2

4

1 1 2 2

1

0

Case 1: 5

Case 2: 1

SPECIAL THANKS: JANE ALAM JAN

注意：输入的数为除了本身之外，所以要加1！

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int a[55];
int main()
{
int T,N;
scanf("%d",&T);
N=T;
while(T--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]+=1;
}
printf("Case %d: ",N-T);
sort(a+1,a+n+1);
int sum=a[1],cnt=1;
for(int i=2;i<=n;i++)
{
if(a[i]!=a[i-1])
{
sum+=a[i];
cnt=1;
}
else
{
if(cnt<a[i])
cnt++;
else
{
sum+=a[i];
cnt=1;
}
}
}
printf("%d\n",sum);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：79151次
• 积分：3568
• 等级：
• 排名：第9614名
• 原创：291篇
• 转载：4篇
• 译文：0篇
• 评论：5条
阅读排行
评论排行
最新评论