#C3033. Minimum Effort for a Full Lap
Minimum Effort for a Full Lap
Minimum Effort for a Full Lap
You are given a circular track divided into several segments. Each segment requires a certain amount of effort to traverse. Your task is to compute the total effort required to complete one full lap around the track.
Formally, if the efforts for each segment are given by \(a_1, a_2, \dots, a_n\), you should calculate the sum:
\(\text{Total Effort} = \sum_{i=1}^{n} a_i\)
This problem is straightforward and requires you to correctly process the input and compute the sum.
inputFormat
The first line contains a single integer \(n\) (\(n \ge 1\)), the number of segments.
The second line contains \(n\) space-separated integers, representing the effort required for each segment.
outputFormat
Output a single integer, which is the total effort required to complete one full lap around the track.
## sample5
3 2 1 5 4
15