CodeForces 379A Valera and Plates
来源:互联网 发布:java中getresource方法 编辑:程序博客网 时间:2024/05/17 08:34
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.
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.
Print a single integer — the minimum number of times Valera will need to wash a plate/bowl.
3 1 11 2 1
1
4 3 11 1 1 1
1
3 1 22 2 2
0
8 2 21 2 1 2 1 2 1 2
4
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;}
- CodeForces 379A Valera and Plates
- codeforces A. Valera and Plates 题解
- A. Valera and Plates
- A. Valera and Plates----贪心
- Codeforces Round #216 (Div. 2) A. Valera and Plates
- codeforce Valera and Plates
- codeforces 404A - Valera and X
- Codeforces A. Valera and X 题解
- CodeForces 441 A. Valera and Antique Items
- CodeForces 252A-Valera and Antique Items
- CodeForces 441A Valera and Antique Items
- CodeForces 441A Valera and Antique Items
- CodeForces - 404A: Valera and X
- CodeForces 404A Valera and X【水题】
- codeforces 441A Valera and Antique Items
- codeforces-Valera and Fruits
- Codeforces Valera and Fruits
- Codeforces Round #252 (Div. 2)A. Valera and Antique Items
- java登陆注册界面参考的资料和代码
- python入门笔记(1)
- POJ 2823 Sliding Window(优先队列)
- 图形学中的Hermite曲线
- iOS渐隐渐现效果跳转
- CodeForces 379A Valera and Plates
- 远离国产!电脑垃圾清理工具:ccleaner和CleanMyMac
- C++命名空间
- 随机数,and()、random()、arc4random()
- JNI编程学习(一)
- Google Hacking
- makefile同名目标处理
- Android Studio 圆形头像
- Windows10开启热点