forked from ansh-ptel/HackerRank-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathapple_and_orange.java
72 lines (52 loc) · 1.82 KB
/
apple_and_orange.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
70
71
72
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Solution {
/*
* Complete the countApplesAndOranges function below.
*/
static void countApplesAndOranges(int s, int t, int a, int b, int[] apples, int[] oranges) {
int count1=0,count2=0;
for(int i=0;i<apples.length;i++){
int a1=a+apples[i];
if(a1>=s&&a1<=t){
count1++;
}
}
for(int j=0;j<oranges.length;j++){
int a1=b+oranges[j];
if(a1>=s&&a1<=t){
count2++;
}
}
System.out.println(count1);
System.out.println(count2);
}
private static final Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
String[] st = scan.nextLine().split(" ");
int s = Integer.parseInt(st[0].trim());
int t = Integer.parseInt(st[1].trim());
String[] ab = scan.nextLine().split(" ");
int a = Integer.parseInt(ab[0].trim());
int b = Integer.parseInt(ab[1].trim());
String[] mn = scan.nextLine().split(" ");
int m = Integer.parseInt(mn[0].trim());
int n = Integer.parseInt(mn[1].trim());
int[] apple = new int[m];
String[] appleItems = scan.nextLine().split(" ");
for (int appleItr = 0; appleItr < m; appleItr++) {
int appleItem = Integer.parseInt(appleItems[appleItr].trim());
apple[appleItr] = appleItem;
}
int[] orange = new int[n];
String[] orangeItems = scan.nextLine().split(" ");
for (int orangeItr = 0; orangeItr < n; orangeItr++) {
int orangeItem = Integer.parseInt(orangeItems[orangeItr].trim());
orange[orangeItr] = orangeItem;
}
countApplesAndOranges(s, t, a, b, apple, orange);
}
}