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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
#include <bits/stdc++.h>
using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge
{
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug
{
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;

#define imie(...) "" << #__VA_ARGS__ " = " << (__VA_ARGS__) << ", "
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second

#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define vt vector

using ll = long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

using vi = vt<int>;
using vvi = vt<vi>;
using vll = vt<ll>;
using vvll = vt<vll>;
using vs = vt<string>;
using vpi = vt<pi>;
using vvpi = vt<vpi>;
using vpll = vt<pll>;
using vvpll = vt<vpll>;

const int mod = 1e9 + 7;
const int nax = 1e6 + 9;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    int n, k;
    cin >> n >> k;
    vi v(n);
    for (int &i : v)
        cin >> i;
    sort(all(v));
    reverse(all(v));
    int cnt = 0;
    int pos = 0;
    while (pos < n && cnt < k)
    {
        cnt++;
        while (pos < n - 1 && v[pos] == v[pos + 1])
            cnt++, pos++;
        pos++;
    }
    cout << cnt;
}