-
Notifications
You must be signed in to change notification settings - Fork 35
/
Copy pathD.java
40 lines (34 loc) · 1.13 KB
/
D.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
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayDeque;
import java.util.Scanner;
public class D {
public static void main(String[] args) throws IOException {
Scanner scanner = new Scanner(new File("stack-min.in"));
FileWriter fileWriter = new FileWriter(new File("stack-min.out"));
int n = scanner.nextInt();
ArrayDeque<Integer> stack = new ArrayDeque<Integer>();
for (int i = 0; i < n; i++) {
int cur = scanner.nextInt();
switch (cur) {
case 1:
int val = scanner.nextInt();
if (stack.isEmpty()) {
stack.push(val);
} else {
val = Integer.min(val, stack.peek());
stack.push(val);
}
break;
case 2:
stack.pop();
break;
case 3:
fileWriter.write(stack.peek() + "\n");
break;
}
}
fileWriter.flush();
}
}