-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path피자 굽기.java
67 lines (55 loc) · 1.79 KB
/
피자 굽기.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
/**
* N개의 피자 반죽을 구우려고 함
* 오븐이 깊은 관처럼 생겼는데 지름이 깊이에 따라 변함
* 피자 반죽은 완성 순서대로 오븐에 들어감
* 맨 위의 피자가 얼마나 깊이 들어갔는지 알아내기
*/
import java.io.*;
import java.util.*;
public class Main {
int D, N;
int[] oven, pizza;
int answer = 0;
public void solution() throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
D = Integer.parseInt(st.nextToken());
N = Integer.parseInt(st.nextToken());
st = new StringTokenizer(br.readLine());
oven = new int[D];
pizza = new int[N];
int temp;
oven[0] = Integer.parseInt(st.nextToken());
for (int i = 1; i < D; i++){
temp = Integer.parseInt(st.nextToken());
if (oven[i-1] < temp){
oven[i] = oven[i-1];
}else{
oven[i] = temp;
}
}
st = new StringTokenizer(br.readLine());
for (int j = 0; j < N; j++){
pizza[j] = Integer.parseInt(st.nextToken());
}
int oi = D-1;
int pi = 0;
while (pi < N && oi >= 0){
// System.out.println("oi = " + oi);
// System.out.println("pi = " + pi);
if (oven[oi] < pizza[pi]){
oi -= 1;
} else{
pi += 1;
oi -= 1;
}
}
if (pi >= N){
answer = oi +2;
}
System.out.println(answer);
}
public static void main(String args[]) throws Exception {
new Main().solution();
}
}