15656) N과 M (7) c++

코드 ) 

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N, M;
int arr[9];
vector<int> v;
bool visited[9];

void func(int cnt) {
	if (cnt == M) {
		for (int i = 0; i < M; i++)
			cout << arr[i] << " ";
		cout << "\n";
	}
    
	else {
		for (int i = 0; i < N; i++) {
			arr[cnt] = v[i];
			visited[i] = 1;
			func(cnt+1);
			visited[i] = 0; 
		}
	}
}

int main(void) {
	ios::sync_with_stdio(0);
    cin.tie(0);
	cin >> N >> M;
    
    v.resize(N);
    for(int i=0; i<N; i++){
        cin >> v[i];
    }
    sort(v.begin(), v.end());
	func(0);
}