Codeforces Global Round 2 D. Frets On Fire

思路：二分查找+sort。

#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define mod 1000000007
#define MP make_pair
#define PI pair<int,int>
using namespace std;
const int N = 1e6 + 10;
int n, q;
ll arr[N], l, r, ans, k[N], sum[N];
int main() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    sort(arr + 1, arr + 1 + n);
    int m = unique(arr + 1, arr + 1 + n) - arr - 1;
    for(int i = 1; i < m; i++) {
        k[i] = arr[i + 1] - arr[i];
    }
    k[m] = 1LL << 60;
    sort(k + 1, k + 1 + m);
    for(int i = 1; i <= m; i++) {
        sum[i] = k[i] + sum[i - 1];
    }
    cin >> q;
    for(int i = 0; i < q; i++) {
        cin >> l >> r;
        ll kuan = r - l + 1;
        ll p = lower_bound(k + 1, k + 1 + m, kuan) - k - 1;
        cout << sum[p] + kuan * (m - p) << " ";
    }
    return 0;
}