백준알고리즘
퇴사
먼지의삶
2019. 7. 21. 03:30
import java.util.Scanner;
public class Main {
static int k = Integer.MIN_VALUE;
static void go(int n,int[] t , int[] p,int day, int pay){
if(day == n ){
if(pay > k) k = pay;
return;
}
if(day > n) return;
go(n,t,p,day+t[day], pay+p[day]);
go(n,t,p,day + 1 , pay);
}
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] t = new int[n];
int[] p = new int[n];
for(int i = 0; i < n; i++){
t[i] = sc.nextInt();
p[i] = sc.nextInt();
}
go(n,t,p,0,0);
System.out.println(k);
}
}
DP