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
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <string>
#include <stdint.h>
#include <unordered_map>
#include <algorithm>


using namespace std;


static const int MAX_SCORE = 120;

static const int MIN_SCORE = 1;


static int16_t iN, iK, iResult;

static int16_t aCnt[MAX_SCORE + 1] = { 0, };


static void ReadData()
{
    int16_t iPoints;

    cin >> iN >> iK;

    for (int i = 0; i < iN; ++i)
    {
        cin >> iPoints;

        aCnt[iPoints]++;
    }
}


static void Solve()
{
    iResult = 0;

    for (int i = MAX_SCORE; i >= MIN_SCORE; --i)
    {
        if (aCnt[i] == 0)
            continue;

        iResult += aCnt[i];

        if (iResult >= iK)
            break;
    }
}


int main(int argc, char * argv[])
{
    ReadData();

    Solve();

    cout << iResult;

    return 0;
}