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
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
int main()
{
    set <int> u;
    vector <int> all;
    int n,k,pom;

    cin>>n>>k;

    for(int i=0;i<n;++i)
    {
        cin>>pom;
        u.insert(pom);
        all.push_back(pom);
    }

    reverse_iterator rev = u.rbegin();
    int iter =1;
    while (rev != u.rend())
    {
        rev++;
        iter++;
        if(iter == k)
        {
            pom = *rev;
            break;
        }
        
    }
    
    sort(all.begin(), all.end());

    cout<< all.end() - lower_bound(all.begin(), all.end(), pom);
    return 0;
}