Codeforces VK Cup 2012 Qualification Round 1 / 158A Next Round(模拟)
来源:互联网 发布:东南大学seu网络登录 编辑:程序博客网 时间:2024/04/28 17:34
"Contestant who earns a score equal to or greater than the k-th place finisher's score will advance to the next round, as long as the contestant earns a positive score..." — an excerpt from contest rules.
A total of n participants took part in the contest (n ≥ k), and you already know their scores. Calculate how many participants will advance to the next round.
The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 50) separated by a single space.
The second line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 100), where ai is the score earned by the participant who got the i-th place. The given sequence is non-increasing (that is, for all i from 1 to n - 1 the following condition is fulfilled: ai ≥ ai + 1).
Output the number of participants who advance to the next round.
8 510 9 8 7 7 7 5 5
6
4 20 0 0 0
0
In the first example the participant on the 5th place earned 7 points. As the participant on the 6th place also earned 7 points, there are 6 advancers.
In the second example nobody got a positive score.
注意特判。
完整代码:
/*30ms,0KB*/#include<cstdio>int main(){int n, k, a, i, now;scanf("%d%d", &n, &k);for (i = 1; i <= n; ++i){scanf("%d", &a);if (a == 0){printf("%d", i - 1);return 0;}if (i == k){now = a;}else if (i > k){if (a != now){printf("%d", i - 1);return 0;}}}printf("%d", i - 1);return 0;}
- Codeforces VK Cup 2012 Qualification Round 1 / 158A Next Round(模拟)
- VK Cup 2012 Qualification Round 1 A题
- VK Cup 2012 Qualification Round 1 A题解题报告
- VK Cup 2012 Qualification Round 1 E
- Codeforces VK Cup 2012 Qualification Round 1 /158C (字符串处理)
- VK Cup 2012 Qualification Round B题
- 【dp】VK Cup 2012 Qualification Round 1 ——E
- VK Cup 2012 Qualification Round 1 ( E Phone Talks)
- VK Cup 2012 Qualification Round 1 B. Taxi
- A. Rotate, Flip and Zoom(VK Cup 2015 - Qualification Round 2 简单模拟)
- 【优化&“调整”思想】VK Cup 2012 Qualification Round 1 / 158B Taxi(贪心)
- Codeforces VK Cup 2015 - Round 1 (Div.1 A~E)
- VK Cup 2016 - Qualification Round 1 - D. Running with Obsta(模拟)
- VK Cup 2012 Round 1
- VK Cup 2012 Qualification Round 2 C. String Manipulation 1.0
- VK Cup 2012 Qualification Round 2 E 无语凝噎
- VK Cup 2015 - Qualification Round 1 B. Photo to Remember
- VK Cup 2015 - Qualification Round 1 A. Reposts(map最大连续长度)
- SVN linux 命令
- 导航和状态栏透明
- 水果的正确吃法
- 生成条形码的代码
- js表单验证_用户登录验证
- Codeforces VK Cup 2012 Qualification Round 1 / 158A Next Round(模拟)
- 《Handler: Activity 之间通过 Handler 通信》 & 《通过Handler更新UI》
- hdu 2604 Queuing 矩阵
- JAVA排列组合算法
- JS窗口改变触发事件
- 兔子生兔子
- 推荐一个查看源码的好工具Source Insight
- MapReduce Join联结实现
- “肮脏的”IT工作排行榜