-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathboj_7795.java
More file actions
57 lines (50 loc) · 1.72 KB
/
boj_7795.java
File metadata and controls
57 lines (50 loc) · 1.72 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
package sorting;
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class boj_7795 {
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw=new BufferedWriter(new OutputStreamWriter(System.out));
int T=Integer.parseInt(br.readLine());
StringTokenizer st;
for(int i=0;i<T;i++){
st=new StringTokenizer(br.readLine());
int N=Integer.parseInt(st.nextToken());
int M=Integer.parseInt(st.nextToken());
int[] A=new int[N];
int[] B=new int[M];
st=new StringTokenizer(br.readLine());
for(int j=0;j<N;j++){
A[j]=Integer.parseInt(st.nextToken());
}
//8 1 7 3 1
st=new StringTokenizer(br.readLine());
for(int j=0;j<M;j++){
B[j]=Integer.parseInt(st.nextToken());
}
Arrays.sort(B); //1 2 3 5 6
int res=0;
for(int j=0;j<N;j++){//A 배열 크기만큼 돌기
int first=0;
int end=M-1; //B 배열을 탐색
int idx=0;
while(first<=end){
int mid=(first+end)/2;
if(B[mid]<A[j]){//현재 A배열의 요소보다 작다면
first=mid+1;
idx=mid+1;
}
else{
end=mid-1;
}
}
res+=idx;
}
bw.write(Integer.toString(res)+"\n");
}
bw.flush();
bw.close();
br.close();
}
}