-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBus Conductor
72 lines (55 loc) · 1.62 KB
/
Bus Conductor
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
//{ Driver Code Starts
import java.io.*;
import java.util.*;
class IntArray
{
public static int[] input(BufferedReader br, int n) throws IOException
{
String[] s = br.readLine().trim().split(" ");
int[] a = new int[n];
for(int i = 0; i < n; i++)
a[i] = Integer.parseInt(s[i]);
return a;
}
public static void print(int[] a)
{
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
public static void print(ArrayList<Integer> a)
{
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
}
class GFG {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t;
t = Integer.parseInt(br.readLine());
while(t-- > 0){
int n;
n = Integer.parseInt(br.readLine());
int[] chairs = IntArray.input(br, n);
int[] passengers = IntArray.input(br, n);
Solution obj = new Solution();
int res = obj.findMoves(n, chairs, passengers);
System.out.println(res);
}
}
}
// } Driver Code Ends
class Solution {
public static int findMoves(int n, int[] chairs, int[] passengers) {
// code here
Arrays.sort(chairs);
Arrays.sort(passengers);
int ans=0;
for(int i=0;i<n;i++){
ans+=Math.abs(chairs[i]-passengers[i]);
}
return ans;
}
}