Commit c6bcd8f

committed

배수빈: [PG] 389480 완전범죄_250307

1 parent d17dd97 commit c6bcd8fCopy full SHA for c6bcd8f

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+import java.util.*;`
	`2`	`+`
	`3`	`+class SB_389480 {`
	`4`	`+ public int solution(int[][] info, int n, int m) {`
	`5`	`+ int INF = 1000;`
	`6`	`+ int idx = info.length;`
	`7`	`+`
	`8`	`+ int[][] dp = new int[idx+1][m]; // dp[i][j]=k, i만큼 물건을 훔칠때 B의 흔적개수가 j, 이때 A의 최소 흔적 개수`
	`9`	`+ for(int i=0; i<=idx; i++) {`
	`10`	`+ Arrays.fill(dp[i], INF);`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ dp[0][0] = 0;`
	`14`	`+`
	`15`	`+ for(int i=1; i<=idx; i++){`
	`16`	`+ int a = info[i-1][0]; // 현재 물건을 훔칠때 a,b의 각 흔적`
	`17`	`+ int b = info[i-1][1];`
	`18`	`+ for(int j=0; j<m; j++){`
	`19`	`+ dp[i][j] = Math.min(dp[i][j], dp[i-1][j]+a);`
	`20`	`+ if(j+b < m){`
	`21`	`+ dp[i][j+b] = Math.min(dp[i][j+b], dp[i-1][j]);`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+`
	`26`	`+ int mn = INF;`
	`27`	`+ for(int j=0; j<m; j++){`
	`28`	`+ mn = Math.min(mn, dp[idx][j]);`
	`29`	`+ }`
	`30`	`+ return mn >= n ? -1 : mn;`
	`31`	`+`
	`32`	`+ }`
	`33`	`+}`

Comments

(0)