codeforces——677A——Vanya and Fence
来源:互联网 发布:got it 编辑:程序博客网 时间:2024/05/18 13:48
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 exceedh. If the height of some person is greater thanh he can bend down and then he surely won't be noticed by the guard. The height of thei-th person is equal toai.
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 andh (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), thei-th of them is equal to the height of thei-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 to1 + 1 + 2 = 4.
In the second sample, all friends are short enough and no one has to bend, so the width1 + 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.
输入n,m,然后输入n个数,输入的数小于等于m,则值为1,反之为2,求总值。
水
#include <iostream>#include<cstring>#include<string>#include<stdio.h>#include<algorithm>#include<set>using namespace std;int main(){ int n,m; while(cin>>n>>m!=NULL) { int t=n,ans=0; while(t--) { int t2; cin>>t2; if(t2<=m) ans++; } cout<<(n-ans)*2+ans<<endl; } return 0;}
- codeforces——677A——Vanya and Fence
- codeforces 677A Vanya and Fence(水题)
- CodeForces 677A Vanya and Fence(轧马路)
- codeforces——492A——Vanya and Cubes
- A. Vanya and Fence
- Codeforces Round #355 (Div. 2) A. Vanya and Fence(水题)
- codeforces——492B——Vanya and Lanterns
- CodeForces 552D — Vanya and Triangles 暴力枚举
- Codeforces Round #355 (Div. 2) A. Vanya and Fence (水题)
- ★【16.6.2】Codeforces Round #355 (Div. 2) A. Vanya and Fence
- codeforces A. Vanya and Cards
- Vanya and Fence
- codeforces—— 270A —— Fancy Fence
- Codeforces Round #355 (Div. 2)- Vanya and Fence(模拟)
- cf——H - Vanya and Cards
- codeforces round #235 A. Vanya and Cards
- codeforces 401A - Vanya and Cards
- CodeForces 258A Vanya and Cards
- matlab(3):BP神经网络
- 数据库驱动及URL对应表
- CentOS6.7使用nginx提供静态资源服务,反向代理和负载均衡
- Spring-data JPA初次接触
- Python进阶(五十一)-Flask文件上传提示PermissionError: [Errno 13] Permission denied: 'E:\\IDEA Projects\\Data'
- codeforces——677A——Vanya and Fence
- Residual Squeeze VGG16
- Java发送邮件的几种方式
- Java基础——面向对象的特征
- java使用poi读取excel文档的一种解决方案
- java--HttpClient的使用
- 安卓大图加载-自定义view
- OpenCV学习笔记(12)canny 边缘检测小程序
- unity5 的 standard assets可以单独下载