-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCandyCaneFeast.java
More file actions
39 lines (34 loc) · 1.1 KB
/
Copy pathCandyCaneFeast.java
File metadata and controls
39 lines (34 loc) · 1.1 KB
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
import java.util.Arrays;
import java.util.Scanner;
public class CandyCaneFeast {
public static void main(String[]args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] cowHeights = new int[n];
int[] caneHeights = new int[m];
for(int i=0; i<n; i++){
cowHeights[i] = sc.nextInt();
}
for(int j = 0; j<m; j++){
caneHeights[j] = sc.nextInt();
}
for(int a = 0; a<m; a++){
int low = 0;
for(int b = 0; b<n; b++){
if(cowHeights[b]>low){
if(cowHeights[b]>caneHeights[a]){
cowHeights[b]+=caneHeights[a]-low;
break;
}
int temp = low;
low = cowHeights[b];
cowHeights[b] = cowHeights[b] + cowHeights[b]-temp;
}
}
}
for(int i = 0; i < n; i++){
System.out.println(cowHeights[i]);
}
}
}