N과 M （5）.java

import java.util.*;
import java.io.*;

public class Main {

    static int N;
    static int M;
    static int[] arr = new int[9];

    static int[] num;

    static StringBuilder sb = new StringBuilder();

    static boolean[] visit = new boolean[9];

    public static void main(String[] args) throws IOException{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        N = Integer.parseInt(st.nextToken());
        M = Integer.parseInt(st.nextToken());
        num = new int[N];
        st = new StringTokenizer(br.readLine());

        for(int i = 0; i < N; i++){
            num[i] = Integer.parseInt(st.nextToken());
        }
        
        Arrays.sort(num);

        bt(0);
        System.out.print(sb);
        

    }

    static void bt(int k){
        if(k == M){
            for(int i = 0; i < M; i++){
                sb.append(arr[i]+" ");
            }
            sb.append("\n");
            return;
        }
        for (int i = 0; i < N; i++){
            if(!visit[i]){
                arr[k] = num[i];
                visit[i] = true;
                bt(k+1);
                visit[i] = false;
            }
        }
    }

}