-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15663.cpp
57 lines (49 loc) · 956 Bytes
/
15663.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
//15663 N과 M(9)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
vector<bool> isused;
vector<int> arr;
vector<int> vis;
void func(){
if(vis.size() == m)
{
for(int i =0; i<m; i++)
{
cout << arr[vis[i]] << ' ';
}
cout << '\n';
return;
}
//같은 depth 에서만 안 같음됨
bool check[10001] = {};
for(int i =0; i<n; i++)
{
if(!check[arr[i]]&&!isused[i])
{
isused[i] = 1;
check[arr[i]] = 1;
vis.push_back(i);
func();
isused[i] = 0;
vis.pop_back();
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
int k;
for(int i =0; i<n; i++)
{
cin >> k;
arr.push_back(k);
}
sort(arr.begin(), arr.end());
isused = vector<bool>(n, false);
func();
return 0;
}