# Codeforces Round #355 (Div. 2) A. Vanya and Fence(水题)

A. Vanya and Fence
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vanya and his friends are walking along the fence of height h and they do not want the guard to notice them. In order to achieve this the height of each of the friends should not exceed h. If the height of some person is greater than h he can bend down and then he surely won’t be noticed by the guard. The height of the i-th person is equal to ai.

Consider the width of the person walking as usual to be equal to 1, while the width of the bent person is equal to 2. Friends want to talk to each other while walking, so they would like to walk in a single row. What is the minimum width of the road, such that friends can walk in a row and remain unattended by the guard?

Input
The first line of the input contains two integers n and h (1 ≤ n ≤ 1000, 1 ≤ h ≤ 1000) — the number of friends and the height of the fence, respectively.

The second line contains n integers ai (1 ≤ ai ≤ 2h), the i-th of them is equal to the height of the i-th person.

Output
Print a single integer — the minimum possible valid width of the road.

Examples
input
3 7
4 5 14
output
4
input
6 1
1 1 1 1 1 1
output
6
input
6 5
7 6 8 9 10 5
output
11
Note
In the first sample, only person number 3 must bend down, so the required width is equal to 1 + 1 + 2 = 4.

In the second sample, all friends are short enough and no one has to bend, so the width 1 + 1 + 1 + 1 + 1 + 1 = 6 is enough.

In the third sample, all the persons have to bend, except the last one. The required minimum width of the road is equal to 2 + 2 + 2 + 2 + 2 + 1 = 11.

``````#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
int n,h;
while(~scanf("%d%d",&n,&h))
{
int num,sum=0;
for(int i=0;i<n;i++)
{
scanf("%d",&num);
if(num<=h)
{
sum++;
}
else
{
sum+=2;
}
}
printf("%d\n",sum);
}
return 0;
}
``````

• 本文已收录于以下专栏：

## Codeforces Round #327 (div.2)(A B C D)

codeforces round #327 (div.2)
• lincifer
• 2015年10月26日 13:11
• 1101

## Codeforces Round #355 (Div. 2) A. Vanya and Fence （水题）

A. Vanya and Fence time limit per test 1 second memory limit per test 256 megabytes ...
• liangzhaoyang1
• 2016年06月02日 19:02
• 566

## Codeforces Round #256 (Div. 2) C. Painting Fence（分治+贪心）（好题）

http://codeforces.com/contest/448/problem/C C. Painting Fence time limit per test 1...
• kalilili
• 2015年06月30日 15:31
• 560

## Codeforces Round #431 (Div. 2) A. Odds and Ends 题解

• LamdaSniper
• 2017年09月03日 16:13
• 234

## Codeforces Round #258 (Div. 2)-(A,B,C,D,E)

A:Game With Sticks 水题。。。每次操作，都会拿走一个横行，一个竖行。 所以一共会操作min（横行，竖行）次。 #include #include #include #include ...
• rowanhaoa
• 2014年07月25日 14:39
• 1485

## 【解题报告】Codeforces Round #401 (Div. 2)

• TRiddle
• 2017年02月25日 17:55
• 416

## Codeforces Round #304 (Div. 2) A,B,C题解

A. Soldier and Bananas time limit per test 1 second memory limit per test 256 megabytes input ...
• qq_24489717
• 2015年05月27日 13:48
• 1001

## Codeforces Round #431 (Div. 2) A. Odds and Ends

A. Odds and Ends time limit per test 1 second memory limit per test 256 megabytes input ...
• qq_37943488
• 2017年09月02日 10:20
• 123

## ★【16.6.2】Codeforces Round #355 (Div. 2) A. Vanya and Fence

A. Vanya and Fence time limit per test 1 second memory limit per test 256 megabytes ...
• SatenRuiko
• 2016年06月06日 15:03
• 160

## Codeforces Round #460 (Div. 2) D. Substring（拓扑排序）

• cyf199775
• 2018年02月01日 13:55
• 48

举报原因： 您举报文章：Codeforces Round #355 (Div. 2) A. Vanya and Fence(水题) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)