A. Vanya and Fence
2016-06-03 21:28
543 查看
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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
output
input
output
input
output
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 to2 + 2 + 2 + 2 + 2 + 1 = 11.
解题说明:此题是一道水题,如果高度超过指定值就把宽度加1。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
int main()
{
int n,h,a[1000],s,i;
scanf("%d%d",&n,&h);
s=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]>h)
{
s=s+2;
}
else
{
s=s+1;
}
}
printf("%d\n",s);
return 0;
}
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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 to2 + 2 + 2 + 2 + 2 + 1 = 11.
解题说明:此题是一道水题,如果高度超过指定值就把宽度加1。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
int main()
{
int n,h,a[1000],s,i;
scanf("%d%d",&n,&h);
s=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]>h)
{
s=s+2;
}
else
{
s=s+1;
}
}
printf("%d\n",s);
return 0;
}
相关文章推荐
- JQuery选择器
- angular中的factory、service和provider
- 行为委托
- JSP基础语法和相关用法
- jsp------实现MD5加密
- js-shortid:优雅简洁地实现短ID
- js ,jsp获取项目应用名
- js,javascript,jquery网页返回顶部代码
- jquery 下拉导航
- [bzoj1015][JSOI2008]星球大战starwar
- CSS类似微软中国首页的竖向选项卡
- 【Poj2825】Perfect Permutation 构造
- MyEclipse 2015实现JavaScript代码自动提示(不需要额外安装插件)
- 硬连接与软连接,inode与links
- 硬连接与软连接,inode与links
- javascript-第四节-冒泡排序、数组函数
- CSS基础:z-index详解
- 前端加后端验证倒计时答题功能实现
- HTML编辑器
- css中清除浮动的主要方法