In the battle with the Trade Federation, Queen Amidala decided to ask gungans for help. Jar Jar Binks escorted the Queen and her people to the holy place where they had an agreement. The gungans agreed
to provide their army in order to get the droids of the Federation out from the capital. The gungan ruler Boss Nass was so grateful for uniting the nations that he appointed Jar Jar a general.
And here they are: two armies lined up along the bank of the swamp. The droids of the Federation are well-disciplined soldiers. They stand in neat formation, divided into n blocks of k droids
each. The gungans have a foolproof weapon against droids, which is small energy balls called boom booms. One such ball can disable exactly one droid.
Jar Jar Binks also decided to split his army into n parts and give each part a task to destroy the corresponding block of droids. Each part received a truck with boom booms. Now help general
Binks calculate the number of boom booms that will be left unused and the number of droids that will survive the attack. You can assume that when a boom boom is fired at a droid by a gungan, it always hits the target.
Input
The first line of the input contains numbers n and k (1 ≤ n, k ≤ 10 000). The second line containsn numbers ai (0 ≤ ai ≤ 100 000) —
the number of boom-booms in the i-th truck.
Output
Print two integers — the number of unused boom booms and the number of survived droids.
Sample
|
input |
output |
4 5
2 7 5 0
|
2 8
|
水题，题意难懂
意思：星球大战，有n个区域，每个区域k个目标。
攻击也分成n个组，每组ai个炸弹。每个炸弹炸一个目标。
问最后剩余的目标数和炸弹数。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<limits.h>
using namespace std;
int n,m;
int main()
{
while(~scanf("%d%d",&n,&m))
{
int s=0,sum=0,x;
for(int i=0;i<n;i++)
{
scanf("%d",&x);
if(x<m)
s+=(m-x);//记录目标数
if(x>m)
sum+=(x-m);//记录炸弹数
}
printf("%d %d\n",sum,s);
}
return 0;
}
（校赛）URAL 1991 The battle near the swamp,布布扣,bubuko.com
（校赛）URAL 1991 The battle near the swamp
原文：http://blog.csdn.net/u013582254/article/details/38232743
