#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main(void){
    int n, k;
    cin >> n >> k;
    int p, maxi = -1;
    map<int, int> m;
    for (int i = 0; i < n; i++) {
        cin >> p;
        maxi = max(p, maxi);
        if (m.find(p) == m.end()) {
            m.insert(make_pair(p, 1));
        }
        else m[p]++;
    }
    
    int sum = 0;
    decltype(m)::iterator it = prev(m.end());
    for (int i = 0; i < m.size(); i++) {
        sum += it->second;
        if (sum > k) {
            sum -= it->second;
            break;
        }
        it--;
    }
    int ans = sum;
    cout << ans << endl;
}