Inaho V

Points: 3 (partial)

Time limit: 0.2s

Memory limit: 64M

Authors:

Problem type

Inaho has arrived at the gates to return to his petty $3$ ~3~-dimensional world, but the gates are locked! He wants to get home as quickly as possible to continue playing his Graph Simulator 2015, that is within $0.2$ ~0.2~ seconds, but the gates are preventing him from leaving. On the gates are $M$ ~M~ nonpositive integers, and he believes finding the sum will allow him back into his $3$ ~3~-dimensional world. Of course, he is still stuck in the $N$ ~N~-dimensional hole, and therefore cannot comprehend the complexities of $N$ ~N~-dimensions, so he needs your help again.

Input Specification

The first line will contain the integer $M$ ~M~ $(1 \le M \le 1000)$ ~(1 \le M \le 1000)~, the number of integers on the gates.

The second line will contain $M$ ~M~ space-separated nonpositive integers, $a_1, a_2, \dots, a_M$ ~a_1, a_2, \dots, a_M~ $(-2^{54} \le a_i \le 0)$ ~(-2^{54} \le a_i \le 0)~.

Subtasks

For 1 of the 3 available marks, $-2^{52} \le a_i \le 0$ ~-2^{52} \le a_i \le 0~.

Output Specification

Output the sum of the $M$ ~M~ nonpositive integers.

Sample Input 1

2
-1 -4

Sample Output 1

-5

Sample Input 2

5
-4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496 -4503599627370496

Sample Output 2

-22517998136852480

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation.

Comments

-1

Panicatol648989 commented on Jan. 5, 2019, 4:13 p.m.

It says that the time limit is 0.2 seconds. But when I dive into the submissions some of the ACs have a time of more than 0.2, like 1.44, 0.26, 0.44, and 0.33. Is this supposed to be like this? BTW I haven't solved this yet

2

Kirito commented on Jan. 5, 2019, 4:24 p.m.

Best submissions shows the sum of execution times.

0

Panicatol648989 commented on Jan. 10, 2019, 1:01 a.m.

OH ok now I understand, thanks you!