水题CodeForces 120C

CodeForces 120C

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 120C

Description

input

input.txt

output

output.txt

As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may guess, Winnie and the Piglet asked to come at the Rabbit's place. Thus, there are n jars of honey lined up in front of Winnie-the-Pooh, jar number i contains a_i kilos of honey. Winnie-the-Pooh eats the honey like that: each time he chooses a jar containing most honey. If the jar has less that k kilos of honey or if Winnie-the-Pooh has already eaten from it three times, he gives the jar to Piglet. Otherwise he eats exactly k kilos of honey from the jar and puts it back. Winnie does so until he gives all jars to the Piglet. Count how much honey Piglet will overall get after Winnie satisfies his hunger.

Input

The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 100). The second line contains n integers a₁, a₂, ..., a_n, separated by spaces (1 ≤ a_i ≤ 100).

Output

Print a single number — how many kilos of honey gets Piglet.

Sample Input

Input

3 3
15 8 10

Output

9

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
int n,k;
int a[110];
scanf("%d%d",&n,&k);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]>=3*k)
a[i]-=3*k;
else if(a[i]>=2*k)
a[i]-=2*k;
else if(a[i]>=k)
a[i]-=k;

}
int sum=0;
for(i=0;i<n;i++)
{
sum+=a[i];
}
printf("%d\n",sum);

return 0;
}