Source Code
#include <bits/stdc++.h>

using namespace std;
int main() {
	int n,k; cin >> n >> k;
	vector<int> v(n);
	map<int, int> m;
	for (int i = 0; i < n; i++)
		cin >> v[i];
		
		sort(v.begin(),v.end());
		
	for (int i = 0; i < n; i++)
		m[v[i]]++;

	long long ans = v[k - 1];
	
	for (auto x : m)
	{
		if (k <= 0)
		{
			ans += k;
			k =0 ;
			break;
		}
		k = k - x.second;
		ans += x.second - 1;
	}

       if (k <= 0)
		{
			ans += k;
		}
		
	cout << ans ;
}
Copy
Cutting Trees momo
GNU G++17
52 ms
3.3 MB
Wrong Answer