Skip to content

Commit 765319d

Browse files
authored
Kcm greedy hw (#59)
* 찬민 dfs/bfs 백준 숙제 * 백준 1600 * 찬민 책 Greedy숙제
1 parent ccd4ad4 commit 765319d

File tree

3 files changed

+55
-1
lines changed

3 files changed

+55
-1
lines changed
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
n = int(input())
2+
3+
arr = list(map(int, input().split()))
4+
arr.sort()
5+
6+
target = 1
7+
for i in arr:
8+
if target < i:
9+
break
10+
target += i
11+
12+
print(target)
13+
14+
15+
16+
17+
'''
18+
5
19+
3 2 1 1 9
20+
'''

‎cmkim/무지의 먹방 라이브_316p.py‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -76,4 +76,5 @@ def solution(food_times, k):
7676

7777
# print(answer)
7878

79-
return answer
79+
return answer
80+

‎cmkim/볼링공 고르기_315p.py‎

Lines changed: 33 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
n, m = map(int, input().split())
2+
arr = list(map(int, input().split()))
3+
repeated = [0] * (11)
4+
repeatedsum = 0
5+
6+
def nCr(x, y):
7+
a = 1
8+
b = 1
9+
for i in range(x, x-y, -1):
10+
a *= i
11+
for i in range(y, 0, -1):
12+
b *= i
13+
14+
return a//b
15+
16+
for i in arr:
17+
repeated[i] += 1
18+
19+
for i in range(m+1):
20+
if repeated[i] > 1:
21+
repeatedsum += nCr(repeated[i], 2)
22+
23+
result = nCr(n, 2) - repeatedsum
24+
25+
print(result)
26+
27+
'''
28+
5 3
29+
1 3 2 3 2
30+
31+
8 5
32+
1 5 4 3 2 4 5 2
33+
'''

0 commit comments

Comments
 (0)