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 <bits/stdc++.h>

using namespace std;

void swap(int* a, int* b) 
{ 
    int t = *a; 
    *a = *b; 
    *b = t; 
} 
  
int partition (int tab[], int low, int high) 
{ 
    int pivot = tab[high];
    int i = (low - 1);
  
    for (int j = low; j <= high - 1; j++) 
    { 
        if (tab[j] < pivot) 
        { 
            i++;
            swap(&tab[i], &tab[j]); 
        } 
    } 
    swap(&tab[i + 1], &tab[high]); 
    return (i + 1); 
} 

void quickSort(int tab[], int low, int high) 
{ 
    if (low < high) 
    { 
        int pi = partition(tab, low, high); 
  
        quickSort(tab, low, pi - 1); 
        quickSort(tab, pi + 1, high); 
    } 
} 

int main(){
	
	int n, k, tab[n], answer;
	
	cin>>n>>k;
	
	answer=k;
	
	for(int i=0; i<n; i++){
		cin>>tab[i];
	}
	
	quickSort(tab, 0, n-1);
		
	int j=n-k-1;
	
	while(tab[j]==tab[n-k]){
		answer++;
		j--;
	}
	
	cout<<answer;
	
	return 0;	
}