28249번: Chili Peppers
The first line of input will contain a positive integer $N$, representing the number of peppers Ron adds to his chili. The next $N$ lines will each contain the name of a pepper Ron has added. Each pepper name will exactly match a name that appears in the t
www.acmicpc.net
mapping
- 제목
Chili Peppers
- 조건
시간 제한 : 초
메모리 제한 : MB
- 문제
Ron is cooking chili using an assortment of peppers.
The spiciness of a pepper is measured in Scoville Heat Units (SHU). Ron's chili is currently not spicy at all, but each time Ron adds a pepper, the total spiciness of the chili increases by the SHU value of that pepper.
The SHU values of the peppers available to Ron are shown in the following table:
Pepper Name | Scolville Heat Units |
Poblano | 1500 |
Mirasol | 6000 |
Serrano | 15500 |
Cayenne | 40000 |
Thai | 75000 |
Habanero | 125000 |
Your job is to determine the total spiciness of Ron's chili after he has finished adding peppers.
- 입력
The first line of input will contain a positive integer , representing the number of peppers Ron adds to his chili. The next lines will each contain the name of a pepper Ron has added. Each pepper name will exactly match a name that appears in the table above. Note that more than one pepper of the same name can be added.
- 출력
The output will consist of a positive integer , representing the total spiciness of Ron's chili.
예제 입력1 | 예제 출력1 |
4 Poblano Cayenne Thai Poblano |
118000 |
pepper ={
"Poblano": 1500,
"Mirasol": 6000,
"Serrano": 15500,
"Cayenne": 40000,
"Thai": 75000,
"Habanero": 125000,
}
N = int(input())
sum = 0
for _ in range(N):
sum += pepper[input()]
print(sum)
'Problem Solving > BaekJoon' 카테고리의 다른 글
[BOJ/백준] 5427 - 불 (0) | 2023.08.09 |
---|---|
[BOJ/백준] 1244 - 스위치 켜고 끄기 (0) | 2023.08.02 |
[BOJ/백준] 10422 - 괄호 (0) | 2023.08.02 |
[BOJ/백준] 17103 - 골드바흐 파티션 (0) | 2023.07.25 |
[BOJ/백준] 7490 - 0 만들기 (0) | 2023.07.25 |