Codeforces VK Cup 2012 Qualification Round 1 / 158A Next Round(模拟)

关注

原创最新推荐文章于 2026-07-13 09:43:20 发布 995 阅读 AI 写同款· GEO 优化 ›

【愚公系列】《AIGC辅助软件开发》041-如何使用 AI技术提升工作效率：AI辅助软件架构师实践在数字化转型的浪潮中，软件架构师作为技术团队的核心，承载着系统设计与架构优化的重要责任。然而，随着项目复杂度的增加和技术环境的变化，架构师面临着前所未有的挑战。幸运的是，人工智能（AI）技术的迅猛发展为这一行业带来了新的机遇，帮助架构师提升工作效率、优化决策过程，并改善团队协作。本文将深入探讨AI如何辅助软件架构师的实际工作，具体分析AI在需求分析、架构设计、代码生成、测试和优化等环节的应用。阅读详情

"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.

Input

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 a₁, a₂, ..., a_n (0 ≤ a_i ≤ 100), where a_i 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: a_i ≥ a_i + 1).

Output

Output the number of participants who advance to the next round.

   Sample test(s)
 
     input
   
8 5
10 9 8 7 7 7 5 5

     output
   
6

     input
   
4 2
0 0 0 0

     output
   
0

Note

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;
}