P1138_桶排序

#include<iostream>
using namespace std;
int main() {
	int n, k;
	int array[30001]={0};
	int number;
	int counter = 0;
	int sign=1;

	cin >> n >> k;
	for (int i = 0; i < n; i++) {
		cin >> number;
		array[number] = 1;
	}

	for(int i=0;i<30001;i++){
		if (array[i] == 1)counter++;
		if (counter == k) {
			cout << i;
			return 0;
		}
	}
	cout << "NO RESULT";
	return 0;
}