it's a C++ question.

Write a function int atleast (int x], int n, int k); that has an array parameter x with size n. (Assume n > o.) Among all values in x that appear at least k times, this function finds the smallest one and returns its value. E.g., suppose the array a has contents 4, 7, 2, 6, 4, 7, 7, 6, 4, 6, 6}.The function call atleast (a, 11, 3) should return 4, because 4, 6, and 7 appear at least three times in a, and 4 is the smallest.