Codeforces Round #415 C. Do you want a date?

Do you want a date?
time limit per test 2 seconds
memory limit per test 256 megabytes

Description
Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access to n computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on the same straight line, due to the reason that there is the only one straight street in Vičkopolis.

Let’s denote the coordinate system on this street. Besides let’s number all the hacked computers with integers from 1 to n. So the i-th hacked computer is located at the point xi. Moreover the coordinates of all computers are distinct.

Leha is determined to have a little rest after a hard week. Therefore he is going to invite his friend Noora to a restaurant. However the girl agrees to go on a date with the only one condition: Leha have to solve a simple task.

Leha should calculate a sum of F(a) for all a, where a is a non-empty subset of the set, that consists of all hacked computers. Formally, let’s denote A the set of all integers from 1 to n. Noora asks the hacker to find value of the expression . Here F(a) is calculated as the maximum among the distances between all pairs of computers from the set a. Formally, . Since the required sum can be quite large Noora asks to find it modulo 109 + 7.

Though, Leha is too tired. Consequently he is not able to solve this task. Help the hacker to attend a date.

Input
The first line contains one integer n (1 ≤ n ≤ 3·105) denoting the number of hacked computers.

The second line contains n integers x1, x2, …, xn (1 ≤ xi ≤ 109) denoting the coordinates of hacked computers. It is guaranteed that all xi are distinct.

Output
Print a single integer — the required sum modulo 1e9 + 7.

Examples
Input
2
4 7
Output
3
Input
3
4 3 1
Output
9

Note
There are three non-empty subsets in the first sample test:, and . The first and the second subset increase the sum by 0 and the third subset increases the sum by 7 - 4 = 3. In total the answer is 0 + 0 + 3 = 3.

There are seven non-empty subsets in the second sample test. Among them only the following subsets increase the answer: , , , . In total the sum is (4 - 3) + (4 - 1) + (3 - 1) + (4 - 1) = 9.

题目大意：给你一个非空数集，让你求他所有子集的最大值与最小值的和。

看到题目给你两秒钟，嗯，肯定不能暴力( ＿ ＿)ノ｜
昨晚做这道题的时候想了半天，这东西肯定是有个啥规律的，不然肯定TLE啊。
自己在本子上写了几个例子，似乎发现了某种规律，那就是每个数字作为最大值的次数或是最小值的次数，与其在子集sort后的排序有关，得到了这一点，很快就能写出代码啦( ^ω^)

ps.虽然代码是写出来了，但是却犯了个巨严重的错误，我在读取a[i]的时候忘了加&啊啊啊啊啊啊啊啊，搞得我一行一行调试了半天才发现为啥一直RE

#include <bits/stdc++.h>
const int Max=500005;
#define mod 1000000000+7
using namespace std;
typedef long long ll;
ll cnt[Max];
ll a[Max];
ll sum=0;
int n;
int main()
{
    cnt[0]=1;
    for(int i=1;i<=400000;i++)
    {
        cnt[i]=cnt[i-1]*2;
        cnt[i]%=mod;
    }
    scanf("%d",&n);
    for(int i=0;i<n;i++)
       scanf("%lld",&a[i]);
    sort(a,a+n);
    for(int i=1;i<n;i++)
    {
        sum+=1LL*a[i]*(cnt[i]-1);//强制转化避免数据溢出;排序后从小到大每个数字有(p[i]-1)的机会成为子集中的最大值。
        sum%=mod;
    }
    for(int i=0;i<n-1;i++)//最后一个元素不可能为最小值，所以n-1
    {
        sum-=1LL*a[i]*(cnt[n-i-1]-1);//排序后从小到大每个数字有(p[n-i-1]-1)的机会成为子集中的最小值
        sum%=mod;
    }
    if(sum<0)//前面在取余求和的时候数据可能会炸掉，所以要加个mod再取余，或者是像这里写的一样取余以后再判断是否小于0
       {
           sum+=mod;
           sum%=mod;
       }
    printf("%lld\n",sum);
}