微软面试题 07022012 [1]

/*
Find the kth smallest element in a sorted array
*/

#include <string>
#include <iostream>

int main()
{
	int a[10] = {1,2,2,2,3,3,4,5,6,7};
	int n = 10;

	int count = 1;
	int i = 0;
	
	int k;
	std::cin >> k;

	while(i < n)
	{
		if(a[i] != a[i + 1])
		{
			if(count == k)
			{
				std::cout << k << "smallest number" << a[i];
			}
			count++;
		}
		i++;
	}


	return 0;

}