Skip to content

Commit d064cff

Browse files
authored
Merge pull request #799 from AlgorithmWithGod/JHLEE325
[20250902] BOJ / G5 / 전깃줄 / 이준희
2 parents cc153b6 + 911864f commit d064cff

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed
Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
public static void main(String[] args) throws Exception {
7+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
StringTokenizer st;
9+
10+
int n = Integer.parseInt(br.readLine());
11+
int[][] elec = new int[n][2];
12+
int[] dp = new int[n];
13+
14+
for(int i=0;i<n;i++){
15+
st = new StringTokenizer(br.readLine());
16+
elec[i][0]= Integer.parseInt(st.nextToken());
17+
elec[i][1] = Integer.parseInt(st.nextToken());
18+
}
19+
20+
Arrays.sort(elec,(o1,o2)->{
21+
return o1[0]-o2[0];
22+
});
23+
24+
for(int i=0;i<n;i++){
25+
dp[i]=1;
26+
27+
for(int j=0;j<i;j++){
28+
if(elec[i][1]>elec[j][1]){
29+
dp[i] = Math.max(dp[i],dp[j]+1);
30+
}
31+
}
32+
}
33+
34+
int result = 0;
35+
for(int i=0;i<n;i++){
36+
if(result<dp[i]){
37+
result=dp[i];
38+
}
39+
}
40+
41+
System.out.println(n-result);
42+
}
43+
}
44+
45+
```

0 commit comments

Comments
 (0)