-
Notifications
You must be signed in to change notification settings - Fork 0
/
158A.cpp
77 lines (74 loc) · 1.84 KB
/
158A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
========================================================================================
// **** ***** //
// ***AUTHOR: GAURISH OJHA** //
// *****DATE: 01-03-2022**** //
// ******TIME:23:40:16****** //
========================================================================================
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define dbl double
#define deb(v) cout << #v << " " << v << "\n"
#define foi(i, base, n, k) for (i = base; i < n; i += k)
#define fod(i, base, n, k) for (i = base; i >= n; i -= k)
#define vec(type1, name) vector<type1> name
#define erase(name, i) name.erase(name.begin() + i)
#define vp(type1, type2, name) vector<pair<type1, type2>> name
#define st(type, name) set<type> name
#define mpp(type1, type2, name) map<type1, type2> name
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define all(x) x.begin(), x.end()
#define part(x, a, b) x.begin() + a, x.begin() + b
#define Pi 3.1415926535897932384626
void gaurish()
{
ll i, j, k;
ll n;
cin >> n >> k;
vector<ll> v(n);
foi(i, 0, n, 1)
cin >>
v[i];
ll res = 0;
if (v[k - 1] > 0)
{
res = k;
foi(i, k, n, 1)
{
if (v[i] == v[k - 1])
res++;
else
break;
}
}
else
{
fod(i, k - 1, 0, 1)
{
if (v[i] > 0)
res++;
}
}
cout << res;
return;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ll t = 1;
//cin >> t;
while (t--)
{
gaurish();
}
}