SMSC

题意翻译

【描述】 CZYZ 有一台缓慢的 SMSC(short message service center)用来发送校信通。作为机房管理员的LazyLie 要时刻关注 SMSC 以免它出现故障。 LazyLie 预计,老师会在 $T_i$ 时刻提交发送 $C_i$ 份校信通的申请。这台 SMSC 过于缓慢以至于它每秒只能发送$1$条校信通。对于不能及时发出去的信息,系统会把它添加到等待队列的队尾。 系统在第 $x$ 秒依次迚行如下操作: - 1) 若队列非空则发送队头的消息。 - 2) 若该时刻有新的申请,则加到队尾。 LazyLie 希望知道自己什么时候可以下班,即最后一条消息何时发出。同时,他还想知道队列最大的大小,以确保系统装有足够的内存。 LazyLie 简直弱爆了,他总是会犯各种错误,所以需要你来完成这个任务。 【输入】 - 第一行一个整数 $n$,表示申请数。 - 之后 $n$ 行每行 $2$ 个整数,表示 $T_i$ 和 $C_i$。 【输出】 一行两个整数,表示最后一条消息发出的时间和队列最大的大小。 【说明】 - $1 ≤ C_i,T_i ≤ 10^6 ,n ≤ 1000$ - $T_i$ 单调不减

题目描述

Some large corporation where Polycarpus works has its own short message service center (SMSC). The center's task is to send all sorts of crucial information. Polycarpus decided to check the efficiency of the SMSC. For that, he asked to give him the statistics of the performance of the SMSC for some period of time. In the end, Polycarpus got a list of $ n $ tasks that went to the SMSC of the corporation. Each task was described by the time it was received by the SMSC and the number of text messages to send. More formally, the $ i $ -th task was described by two integers $ t_{i} $ and $ c_{i} $ — the receiving time (the second) and the number of the text messages, correspondingly. Polycarpus knows that the SMSC cannot send more than one text message per second. The SMSC uses a queue to organize its work. Consider a time moment $ x $ , the SMSC work at that moment as follows: 1. If at the time moment $ x $ the queue is not empty, then SMSC sends one message from the queue (SMSC gets the message from the head of the queue). Otherwise it doesn't send messages at the time moment $ x $ . 2. If at the time moment $ x $ SMSC receives a task, then it adds to the queue all the messages from this task (SMSC adds messages to the tail of the queue). Note, that the messages from the task cannot be send at time moment $ x $ . That's because the decision about sending message or not is made at point 1 before adding these messages to the queue. Given the information about all $ n $ tasks, Polycarpus wants to count two values: the time when the last text message was sent and the maximum size of the queue at some time. Help him count these two characteristics he needs to evaluate the efficiency of the SMSC.

输入输出格式

输入格式


The first line contains a single integer $ n $ $ (1<=n<=10^{3}) $ — the number of tasks of the SMSC. Next $ n $ lines contain the tasks' descriptions: the $ i $ -th line contains two space-separated integers $ t_{i} $ and $ c_{i} $ $ (1<=t_{i},c_{i}<=10^{6}) $ — the time (the second) when the $ i $ -th task was received and the number of messages to send, correspondingly. It is guaranteed that all tasks were received at different moments of time. It is guaranteed that the tasks are sorted in the chronological order, that is, $ t_{i}&lt;t_{i+1} $ for all integer $ i $ $ (1<=i&lt;n) $ .

输出格式


In a single line print two space-separated integers — the time when the last text message was sent and the maximum queue size at a certain moment of time.

输入输出样例

输入样例 #1

2
1 1
2 1

输出样例 #1

3 1

输入样例 #2

1
1000000 10

输出样例 #2

1000010 10

输入样例 #3

3
3 3
4 3
5 3

输出样例 #3

12 7

说明

In the first test sample: - second 1: the first message has appeared in the queue, the queue's size is 1; - second 2: the first message is sent, the second message has been received, the queue's size is 1; - second 3: the second message is sent, the queue's size is 0, Thus, the maximum size of the queue is 1, the last message was sent at the second 3.