Creating all possible combinations by taking k no: of items from an array with n no: of items in C++

Question

I\'m looking for a way to insert an array with length n and get all possible combinations with length k. The elements can repeat.

If the no: of elements in the array = n