logo AlgoBeat OnlineJudge
登录 注册

#214593. [ICPC 2025 Xi'an R] Grand Voting

内存限制:512 MiB 时间限制:1000 ms 标准输入输出
题目类型:VJudge(洛谷) 评测方式:VJudge
上传者: 匿名

题目描述

Dada organized a contest, but it received heavy downvotes. He decided to start manipulating the comments.

This contest has votes, initially set to .

There are participants, each with a voting parameter . When it's their turn to vote:

  • If , they cast an upvote, incrementing by .
  • If , they cast a downvote, decrementing by .

Dada can control the voting order of these people. He wants to know the maximum and minimum possible vote count in this contest.

输入格式

The first line of input contains a single integer (), representing the number of voters.

The next line of input contains integers (), separated by spaces.

输出格式

Output one line containing two integers separated by a space, representing the maximum and minimum vote count in this contest.

样例

样例输入 1

5
-1 0 1 2 3

样例输出 1

5 -5

数据范围与提示

For example, if you rearrange to , initially . Since , the first voter casts an upvote, making . Similarly, the remaining four voters also satisfy , so all cast upvotes. The final value of is , which is the maximum possible.

Conversely, if you rearrange to , then for each voter from left to right, holds, so all cast downvotes, resulting in . This is the minimum possible. Another arrangement such as also leads to .