CodeForces 379A Valera and Plates
2016-01-02 16:23
260 查看
A. Valera and Plates
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Valera is a lazy student. He has m clean bowls andk clean plates.
Valera has made an eating plan for the next n days. As Valera is lazy, he will eat exactly one dish per day. At that, in order to eat a dish, he needs exactly oneclean plate or
bowl. We know that Valera can cook only two types of dishes. He can eat dishes of the first type from bowls and dishes of the second type from either bowls or plates.
When Valera finishes eating, he leaves a dirty plate/bowl behind. His life philosophy doesn't let him eat from dirty kitchenware. So sometimes he needs to wash his plate/bowlbefore eating. Find the minimum number of
times Valera will need to wash a plate/bowl, if he acts optimally.
Input
The first line of the input contains three integers n,m,k (1 ≤ n, m, k ≤ 1000) —
the number of the planned days, the number of clean bowls and the number of clean plates.
The second line contains n integers
a1, a2, ..., an (1 ≤ ai ≤ 2). Ifai
equals one, then on dayi Valera will eat a first type dish. Ifai equals two, then on dayi Valera will
eat a second type dish.
Output
Print a single integer — the minimum number of times Valera will need to wash a plate/bowl.
Sample test(s)
Input
Output
Input
Output
Input
Output
Input
Output
Note
In the first sample Valera will wash a bowl only on the third day, so the answer is one.
In the second sample, Valera will have the first type of the dish during all four days, and since there are only three bowls, he will wash a bowl exactly once.
In the third sample, Valera will have the second type of dish for all three days, and as they can be eaten from either a plate or a bowl, he will never need to wash a plate/bowl.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Valera is a lazy student. He has m clean bowls andk clean plates.
Valera has made an eating plan for the next n days. As Valera is lazy, he will eat exactly one dish per day. At that, in order to eat a dish, he needs exactly oneclean plate or
bowl. We know that Valera can cook only two types of dishes. He can eat dishes of the first type from bowls and dishes of the second type from either bowls or plates.
When Valera finishes eating, he leaves a dirty plate/bowl behind. His life philosophy doesn't let him eat from dirty kitchenware. So sometimes he needs to wash his plate/bowlbefore eating. Find the minimum number of
times Valera will need to wash a plate/bowl, if he acts optimally.
Input
The first line of the input contains three integers n,m,k (1 ≤ n, m, k ≤ 1000) —
the number of the planned days, the number of clean bowls and the number of clean plates.
The second line contains n integers
a1, a2, ..., an (1 ≤ ai ≤ 2). Ifai
equals one, then on dayi Valera will eat a first type dish. Ifai equals two, then on dayi Valera will
eat a second type dish.
Output
Print a single integer — the minimum number of times Valera will need to wash a plate/bowl.
Sample test(s)
Input
3 1 1 1 2 1
Output
1
Input
4 3 11 1 1 1
Output
1
Input
3 1 2 2 2 2
Output
0
Input
8 2 2 1 2 1 2 1 2 1 2
Output
4
Note
In the first sample Valera will wash a bowl only on the third day, so the answer is one.
In the second sample, Valera will have the first type of the dish during all four days, and since there are only three bowls, he will wash a bowl exactly once.
In the third sample, Valera will have the second type of dish for all three days, and as they can be eaten from either a plate or a bowl, he will never need to wash a plate/bowl.
#include<iostream> #include<algorithm> using namespace std; int main(){ int n,m,k,t,wash; while(cin>>n>>m>>k){ wash=0; for(int i=0;i<n;i++){ cin>>t; if(t==1){ if(m>0){ m--; } else{ wash++; } } else if(t==2){ if(k>0){ k--; } else{ if(m>0){ m--; } else{ wash++; } } } } cout<<wash<<endl; } return 0; }
相关文章推荐
- 细说grep命令
- jquery实现简单的全选和反选功能
- 记录点滴,留给记忆
- java登陆注册界面参考的资料和代码
- HMM 传统后向算法
- FPGA笔记 Altera Cyclone系列FPGA资源介绍
- grep、egrep
- 【设计模式】代理模式
- 多文件夹下编写Makefile详解
- C#之方法与函数
- Proximal Gradient Method近端梯度算法
- jquery中focus()函数实现当对象获得焦点后自动把光标移到内容最后
- NSTimer的使用以及NSTimer暂停和继续
- 【VBA研究】查找目录以下全部文件的名称
- 蓝桥杯 算法训练 未名湖边的烦恼
- 【ZYNQ-7000开发之八】OLED的驱动
- Java 图片提取RGB数组 RGBOfCharMaps (整理)
- nyoj--514--1的个数(贪心)
- bash shell 中的比较
- 通过SQL Server 2008数据库复制实现数据库同步备份