linlinsong—ACM界蒟水!

拼命的向前跑,即使会栽倒!

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.

大水题,看样例就能过了。
下面是AC代码:

#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;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_32866009/article/details/51565797
文章标签: codeforces
个人分类: CodeForces 简单题目
上一篇hihocoder 1257 扩展欧几里得
下一篇运算符的重载(复数的加减)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭