Messages

题意翻译

**题目描述**: ------------ Vasya有n封信。第i封信将在ti秒之后接收。 每封信都开始都值a元,但收到消息后,消息的成本每分钟减少B元(B可能变为负数)。Vasya可以在任意时刻接收到任何消息,也可在任意时刻读取它。读完消息后,Vasya的银行账户会收到该消息的当前成本。最初,Vasya的银行账户为0。 同时,每分钟Vasya的银行账户会收到C·k元,k是收到了但未读信的数量。 Vasya非常贪婪(又一个葛朗台),正因为如此,他想让所有的信息在T分钟后被阅读,使其利益最大化。 ------------ **输入输出格式:** ------------ _输入格式:_ ------------ 第一行输入5个数 n , A , B , C 与 T ( 1<=n,A,B,C,T<=1000 ). 第二个字符串包含n个整数 ti ​ ( 1<=ti<=T ) ------------ _输出格式:_ ------------ 输出一个整数,问题的答案。

题目描述

There are $ n $ incoming messages for Vasya. The $ i $ -th message is going to be received after $ t_{i} $ minutes. Each message has a cost, which equals to $ A $ initially. After being received, the cost of a message decreases by $ B $ each minute (it can become negative). Vasya can read any message after receiving it at any moment of time. After reading the message, Vasya's bank account receives the current cost of this message. Initially, Vasya's bank account is at $ 0 $ . Also, each minute Vasya's bank account receives $ C·k $ , where $ k $ is the amount of received but unread messages. Vasya's messages are very important to him, and because of that he wants to have all messages read after $ T $ minutes. Determine the maximum amount of money Vasya's bank account can hold after $ T $ minutes.

输入输出格式

输入格式


The first line contains five integers $ n $ , $ A $ , $ B $ , $ C $ and $ T $ ( $ 1<=n,A,B,C,T<=1000 $ ). The second string contains $ n $ integers $ t_{i} $ ( $ 1<=t_{i}<=T $ ).

输出格式


Output one integer — the answer to the problem.

输入输出样例

输入样例 #1

4 5 5 3 5
1 5 5 4

输出样例 #1

20

输入样例 #2

5 3 1 1 3
2 2 2 1 1

输出样例 #2

15

输入样例 #3

5 5 3 4 5
1 2 3 4 5

输出样例 #3

35

说明

In the first sample the messages must be read immediately after receiving, Vasya receives $ A $ points for each message, $ n·A=20 $ in total. In the second sample the messages can be read at any integer moment. In the third sample messages must be read at the moment T. This way Vasya has $ 1 $ , $ 2 $ , $ 3 $ , $ 4 $ and $ 0 $ unread messages at the corresponding minutes, he gets $ 40 $ points for them. When reading messages, he receives $ (5-4·3)+(5-3·3)+(5-2·3)+(5-1·3)+5=-5 $ points. This is $ 35 $ in total.