★【16.6.2】Codeforces Round #355 (Div. 2) A. Vanya and Fence
来源:互联网 发布:org.apache.cxf maven 编辑:程序博客网 时间:2024/06/02 07:16
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?
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.
Print a single integer — the minimum possible valid width of the road.
3 74 5 14
4
6 11 1 1 1 1 1
6
6 57 6 8 9 10 5
11
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 to2 + 2 + 2 + 2 + 2 + 1 = 11.
思路:编程题,给定人数和范围 超过范围答案+2,不超+1即可
代码:
#include <iostream>#include <cstdio>#include <cmath>#include <map>#include <algorithm>#include <cstring>using namespace std;int n,h;int i,sum;int a[2222];int main(){ while(~scanf("%d%d",&n,&h)) { sum=0; for(i=1;i<=n;i++) { scanf("%d",&a[i]); if(a[i]>h)sum+=2; else sum+=1; } printf("%d\n",sum); } return 0;}
- Codeforces Round #355 (Div. 2) A. Vanya and Fence(水题)
- ★【16.6.2】Codeforces Round #355 (Div. 2) A. Vanya and Fence
- Codeforces Round #355 (Div. 2)- Vanya and Fence(模拟)
- Codeforces Round #355 (Div. 2) A. Vanya and Fence (水题)
- Codeforces Round #235 (Div. 2) A. Vanya and Cards
- A. Vanya and Table(Codeforces Round #308 (Div. 2))
- Codeforces Round #308 (Div. 2) A. Vanya and Table
- ★【16.6.2】Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- ★【16.6.2】Codeforces Round #355 (Div. 2) C. Vanya and Label
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- Codeforces Round #355 (Div. 2) D. Vanya and Treasure
- Codeforces Round #355 (Div. 2) D. Vanya and Treasure
- Codeforces Round #355 (Div. 2)C - Vanya and Label
- Codeforces Round #355 (Div. 2)C. Vanya and Label
- Codeforces Round #355 (Div. 2)D. Vanya and Treasure
- Codeforces Round #355 (Div. 2)E. Vanya and Balloons
- Codeforces Round #355 (Div. 2)C. Vanya and Label
- Codeforces Round #355 (Div. 2) C. Vanya and Label
- 常用资料备忘
- Git学习笔记
- Merge Sorted Array(easy)
- C#中的ASCII转换
- 盲打
- ★【16.6.2】Codeforces Round #355 (Div. 2) A. Vanya and Fence
- iOS 屏幕方向
- Python装饰器与面向切面编程
- Convert.ToInt32(Object, IFormatProvider)的含义
- for循环创建UIButton,如何去修改边框颜色
- git and github 学习笔记
- Java编程练习目录
- 这应该是迄今为止最全的一份Java就业指导书
- 截取整个ScrollerView视图