Dim Sum!

View as PDF
Submit solution
Points: 3
Time limit: 2.0s
Memory limit: 64M
Author:
Menthol
Problem type

Derek loves to eat dim sum, but it is always a hassle to figure out how much he is going to pay. Given a list of the prices of dishes he ordered, help Derek figure out the sum of all the dim sum dishes!

Input Specification

The first line of input will contain one integer N, the number of dishes to follow.

The next N lines will each contain one integer P, the price of that dish.

Output Specification

Print out one integer S, the total sum of all the prices.

Constraints

1 \le N \le 10^5

1 \le P \le 100

Sample Input

4
2
3
5
3

Sample Output

13

Comments


  • 6
    ryan_ug  commented on Oct. 20, 2021, 11:31 p.m.

    E


    • 0
      Parsa  commented on Oct. 8, 2022, 11:23 p.m.

      E


      • 0
        greedo7  commented on Dec. 20, 2023, 4:26 p.m.

        E