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
|
using System;
class Program
{
private static int maxSum = int.MinValue;
static void Main(string[] args)
{
string[] input = Console.ReadLine().Split();
string[] input2 = Console.ReadLine().Split();
int cardCount = int.Parse(input[0]);
int targetNumber = int.Parse(input[1]);
int[] cards = new int[cardCount];
for (int i = 0; i < cardCount; i++)
cards[i] = int.Parse(input2[i]);
Backtracking(cards, cardCount, targetNumber, 0, 0, 0);
Console.WriteLine(maxSum);
}
private static void Backtracking(int[] cards, int cardsCount, int targetNumber, int startIndex, int currentSum, int drawCount)
{
if (drawCount == 3)
{
if (currentSum <= targetNumber && currentSum > maxSum)
{
maxSum = currentSum;
}
return;
}
for (int i = startIndex; i < cardsCount; i++)
{
if (currentSum + cards[i] > targetNumber) continue;
Backtracking(cards, cardsCount, targetNumber, i + 1, currentSum + cards[i], drawCount + 1);
}
}
}
|
cs |
'백준 - 내 풀이 > 브론즈' 카테고리의 다른 글
[C#]백준/분해합 (0) | 2023.05.01 |
---|