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
#include <iostream>
#include <set>
#include <unordered_map>

struct dvalue {
    int value;
public:
    dvalue(int val) : value(val) {}
    bool operator<(const dvalue& obj2) const {
        return value > obj2.value;
    }
    bool operator>(const dvalue& obj2) const {
        return value < obj2.value;
    }
    bool operator==(const dvalue& obj2) const {
        return value == obj2.value;
    }
};

std::unordered_map<int, int> count_dval;

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);

    int value = 0;
    std::set<dvalue> secik;
    
    int n, k;
    std::cin >> n >> k;

    for (int i = 0; i < n; i++) {
        int value;
        std::cin >> value;
        secik.emplace(value);
        if (count_dval.count(value)) {
            count_dval[value] = count_dval[value] + 1;
        }
        else count_dval[value] = 1;
    }
    for (dvalue val : secik) {
        if (value < k) {
            value += count_dval[val.value];
        }
        else {
            break;
        }

    }
    std::cout << value << std::endl;
    return 0;
}