Solve Buffoon in python

solutions/beecrowd/2963/2963.py

@@ -0,0 +1,14 @@
+n = int(input())
+
+carlos_votes = 0
+for i in range(n):
+    votes = int(input())
+    if i == 0:
+        carlos_votes = votes
+        continue
+
+    if votes > carlos_votes:
+        print('N')
+        break
+else:
+    print('S')

solutions/beecrowd/2963/in.txt

@@ -0,0 +1,4 @@
+3
+100
+1000
+1000

solutions/beecrowd/2963/out.txt

@@ -0,0 +1 @@
+S

solutions/beecrowd/2963/problem.md

@@ -0,0 +1,41 @@
+https://judge.beecrowd.com/en/problems/view/2963
+
+# Buffoon
+
+The Kingdom of Matchings is governed by a generous commander. The commander’s
+fame and great qualities are known to all, including neighboring kingdoms. One
+of his most famous qualities is his good humor, which is nourished daily by a
+court buffoon, elected annually at the Great Comedy Contest (GCC) of the
+kingdom. The court buffoon helps to relieve all the tension of the various
+political meetings the work demands, rejoicing not only the commander but the
+whole kingdom.
+
+Young Carlos is a great comedian whose dream is to become next season’s buffoon.
+He has spent the past few months writing new jokes and puns of various kinds,
+many of which are about his own (tiny) stature. The time has come for the
+buffoon election and a total of $N$ candidates have registered. Each candidate
+will have five minutes to perform in front of the audience. After the
+performances, each citizen of the Kingdom of Matchings may vote for one of the
+candidates, and the most voted candidate will be elected as court buffoon. If
+there is a tie between one or more candidates, the one who registered first is
+elected. Knowing this, young Carlos spent nights in front of the electoral
+office and ensured that his application was the first to be registered.
+
+After the votes, it remains only to determine the results. The voting machine
+generates a report with $N$ integers, corresponding to the number of votes for
+each candidate, ordered in order of registration. Your mission is to determine
+if young Carlos was elected or not.
+
+## Input
+
+The first line of input contains an integer $N$, $(2 \leq N \leq 10^4)$. The
+next $N$ lines will contain $N$ positive integers $v_1 , ... , v_N$, one on each
+line, corresponding to the number of votes each candidate received, in order of
+registration. Since the Kingdom of matchings population is 100000 people, the
+total number of votes will not exceed this value, i.e $\sum_{k=1}^{N} v_i \leq
+100000$.
+
+## Output
+
+Your program must output a single line containing the character ‘S’ if young
+Carlos is elected as buffoon, or the character ‘N’ otherwise.

solutions/beecrowd/2963/tags.txt

@@ -0,0 +1 @@
+beginner