[SWEA] 햄버거 다이어트

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWT-lPB6dHUDFAVT&categoryId=AWT-lPB6dHUDFAVT&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=2

SW Expert Academy

import java.util.Scanner;
import java.io.FileInputStream;
import java.util.*;

class Solution
{
    public static int resources, limitCalories, maxScore;
    public static int[] score, calories;
	public static void main(String args[]) throws Exception
	{

		Scanner sc = new Scanner(System.in);
		int T;
		T=sc.nextInt();

		for(int test_case = 1; test_case <= T; test_case++)
		{
           resources = sc.nextInt();  limitCalories = sc.nextInt();
			score= new int[resources];
           calories = new int[resources];
            for(int i=0; i<resources; i++){
                score[i] = sc.nextInt();
                calories[i] = sc.nextInt();
            }
            maxScore = 0;
            combination(0,0,0);
            System.out.println("#" + test_case + " " + maxScore);
           
		}
	}
    
    private static void combination(int scoreSum,  int caloriesSum, int index){
        if(caloriesSum>=limitCalories)
            return;
        if(index == resources){
           maxScore = Math.max(maxScore, scoreSum);
            return;
        }
        combination(scoreSum + score[index], caloriesSum + calories[index], index +1);
        combination(scoreSum, caloriesSum, index + 1);
    }
}

 

N-queen 문제와 유사하다.