## Algorithm

Problem Name: beecrowd | 2963

# Buffoon

By Maratona de Programação 2019, SBC Brazil

Timelimit: 1

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 re- port 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 ≤ N ≤ 104). The next N lines will contain N positive integers v1 , . . . , vN, one on each line, corresponding to the number of votes each candidate received, in order of registration. Since the Kingdom of matchings population is 100,000 people, the total number of votes will not exceed this value, i.e

.

## Output

Your program must output a single line containing the character ‘S’ if young Carlos is elected as buffoon, or the character ‘N’ otherwise.

 Input Samples Output Samples 3 1000 1000 1000 S

 5 1 2 3 4 5 N

## Code Examples

### #1 Code Example with C Programming

Code - C Programming


#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define true 1
#define false 0
#define MAXSIZE 10100

typedef struct _placar{

int x;
int pos;

} placar;

placar v[MAXSIZE];

int compare(placar *a, placar *b);

int main(int argc, char **argv)
{

int n, i;

scanf("%d", &n);

for (i = 0; i  <  n ; ++i)
scanf("%d", &v[i].x), v[i].pos = i;

int x = v[0].x;

qsort(v, n, sizeof(placar), compare);

if (v[0].pos == 0 && x == v[0].x)
puts("S");
else
puts("N");

return 0;

}

int compare(placar *a, placar *b)
{

if (a->x == b->x)
return a->pos - b->pos;

return b->x - a->x;

}

Copy The Code &

Input

cmd
3 1000 1000 1000

Output

cmd
S

### #2 Code Example with Javascript Programming

Code - Javascript Programming


const { readFileSync } = require("node:fs")
const [N, ...input] = readFileSync("/dev/stdin", "utf8")
.split("\n", 1 + 1e4)
.map(value => Number.parseInt(value, 10))

const candidates = input.splice(0, N)
const mostVotedCandidate = Math.max.apply(null, candidates)

console.log(
candidates.findIndex((candidate) => candidate === mostVotedCandidate) === 0
? "S"
: "N"
)


Copy The Code &

Input

cmd
3 1000 1000 1000

Output

cmd
S

### #3 Code Example with Python Programming

Code - Python Programming


n = int(input())
c = int(input())
p = True
for g in range(n-1):
x = int(input())
if c < x: p = False
if p: print('S')
else: print('N')

Copy The Code &

Input

cmd
3 1000 1000 1000

Output

cmd
S