2024-04-10

AlgoLeadMe · Apr 10, 2024 · 6e0107e · 6e0107e
1 parent 3e585b5
commit 6e0107e
Show file tree

Hide file tree

Showing 2 changed files with 21 additions and 0 deletions.
diff --git a/pu2rile/README.md b/pu2rile/README.md
@@ -5,3 +5,5 @@
 | 1차시 | 2024.03.24 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)  | [#3](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/3#issue-2205834078)|
 | 2차시 | 2024.03.29 |  구현  | [OX퀴즈](https://www.acmicpc.net/problem/8958)  | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/6#issue-2214931034)|
 | 3차시 | 2024.04.02 |  문자열  | [크로아티아 알파벳](https://www.acmicpc.net/problem/8958)  | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/10#issue-2220631332)
+| 4차시 | 2024.04.08 |  스택  | [제로](https://www.acmicpc.net/problem/10773)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/15#issue-2229909173)
+| 5차시 | 2024.04.10 |  그리디 알고리즘  | [국회의원 선거](https://www.acmicpc.net/problem/1417)  | [#]()
diff --git a/pu2rile/그리디 알고리즘/국회의원 선거.py b/pu2rile/그리디 알고리즘/국회의원 선거.py
@@ -0,0 +1,19 @@
+N = int(input())
+dasom = int(input())
+vote = []
+cnt = 0
+
+for _ in range(N-1):
+  vote.append(int(input()))
+
+vote.sort(reverse=True) #내림차순 정렬
+
+if N == 1:
+  print('0')
+else:
+    while vote[0] >= dasom:
+        dasom += 1
+        vote[0] -= 1
+        cnt += 1
+        vote.sort(reverse=True)
+    print(cnt)