-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1208.java
51 lines (50 loc) · 1.3 KB
/
1208.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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Deque;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.StringTokenizer;
public class Solution {
static Deque<Integer> dq;
static Queue<Integer> pq=new PriorityQueue<>();
static StringTokenizer st;
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int dump=0;
int token=0;
int high,low;
for(int i=0;i<10;i++) {
dump=Integer.parseInt(br.readLine());
dq = new LinkedList<>();
st =new StringTokenizer(br.readLine());
while(st.hasMoreTokens()) {
token=Integer.parseInt(st.nextToken());
pq.add(token);
}
while(!pq.isEmpty()) {
dq.addLast(pq.poll());
}
for(int j=0;j<dump;j++) {
high=dq.pollLast()-1;
low=dq.pollFirst()+1;
while(dq.peekLast()>high) {
pq.add(dq.pollLast());
}
dq.addLast(high);
while(!pq.isEmpty()) {
dq.addLast(pq.poll());
}
while(dq.peekFirst()<low) {
pq.add(dq.pollFirst());
}
dq.addFirst(low);
while(!pq.isEmpty()) {
dq.addFirst(pq.poll());
}
}
System.out.println("#"+(i+1)+" "+(dq.peekLast()-dq.peekFirst()));
}
}
}