[JAVA] 백준 15655 N과 M (6)

import java.util.*;
 
public class Main {
 
    static int N;
    static int M;
    static int[] arr;
    static int[] temp;
    static boolean[] visit;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        N = sc.nextInt();
        M = sc.nextInt();
        arr = new int[9];
        temp = new int[N];
        visit = new boolean[9];
        
        for(int i=0;i<N;i++){
            temp[i] = sc.nextInt();
        }
        Arrays.sort(temp);
        dfs(0);
    }
    public static boolean check(){
        for(int i=0;i<M-1;i++){
            if(arr[i]>arr[i+1])
                return false;
        }
        return true;
    }
    public static void dfs(int num){
        if(num==M){
            if(check()){
                for(int i=0;i<M;i++){
                    System.out.print(arr[i]+" ");
                }
                System.out.println();
            }
            
            
            return;
        }
        
        for(int i=0;i<N;i++){
                
                    if(!visit[i]){
                        visit[i] = true;
                        arr[num] = temp[i];
                        dfs(num + 1);
                        visit[i] = false;
                    }
                    
                    
                
 
        }
    }
    
 
}