-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path23883.java
69 lines (51 loc) · 1.68 KB
/
23883.java
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
58
59
60
61
62
63
64
65
66
67
68
69
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
static Map<Integer, Integer> map = new HashMap<>();
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
st = new StringTokenizer(br.readLine());
int[] seq = new int[N];
int[] sorted = new int[N];
boolean flag = false;
for(int i=0;i<N;i++) {
seq[i] = Integer.parseInt(st.nextToken());
sorted[i] = seq[i];
map.put(seq[i], i);
}
Arrays.sort(sorted);
int change = 0;
for(int i=N-1;i>=0;i--) {
if(seq[i] == sorted[i]) {
continue;
}
int index = map.get(sorted[i]);
map.put(seq[i], index);
map.put(sorted[i], i);
int temp = seq[i];
seq[i] = seq[index];
seq[index] = temp;
if(++change == M) {
bw.write(temp + " " + seq[i] + "\n");
flag = !flag;
break;
}
}
if(!flag) {
bw.write(-1+"\n");
}
bw.flush();
}
}