#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m,d;
    cin >> n >> m >> d;
    vector<int> a(n);
    multiset<int> el;
    for(int i = 0;i < n;++i)
    {
        cin >> a[i];
        el.insert(a[i]);
    }
    sort(a.begin(),a.end());
    ll sum = 0;
    for(int i = 0;i < n-1;++i)
    {
        sum += max(0,d - a[i+1] + a[i]);
    }
    for(int i = 0;i < m;++i)
    {
        int x;
        cin >> x;
        el.insert(x);
        auto it = el.find(x);
        int le = -1,re = -1;
        it++;
        if(it != el.end())
        {
            re = *it;
        }
        it--;
        if(it != el.begin())
        {
            le = *(--it);
        }
        if(le != -1 && re != -1)
        {
            sum -= max(0,d - re + le);
        }
        if(le != -1)
            sum += max(0,d - x + le);
        if(re != -1)
            sum += max(0,d - re + x);
        cout << sum/2 << (sum%2 == 1 ? ".5" : "") << ' ';
    }
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |