Codeforces Round #374 (Div. 2) D. Maxim and Array

#include<bits/stdc++.h>
#define maxn 200010
#define mod 1000000007
#define ll long long
#define pb push_back
#define fs first
#define se second
using namespace std;
const int INF=1e9+7;

ll a[maxn];
pair<ll,int> p[maxn];

priority_queue<pair<ll,int>, vector<pair<ll,int> >, greater<pair<ll,int> > > q;

int ok=1;

int main()
{
    int n,k,x;
    scanf("%d%d%d",&n,&k,&x);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        if(a[i]<0) ok^=1;
        p[i].se=i;
        p[i].fs=abs(a[i]);
        q.push(p[i]);
    }
    while(k)
    {
        pair<ll,int> now=q.top();
        q.pop();
        if(ok)
        {
            if(a[now.se]>=0)
            {
                a[now.se]-=x;
                if(a[now.se]<0) ok^=1;
            }
            else
            {
                a[now.se]+=x;
                if(a[now.se]>=0) ok^=1;
            }
            now.fs=abs(a[now.se]);
            q.push(now);
        }
        else
        {
            if(a[now.se]>=0) a[now.se]+=x;
            else             a[now.se]-=x;
            now.fs=abs(a[now.se]);
            q.push(now);            
        }
        k--;
    }
    for(int i=1;i<=n;i++) printf("%lld ",a[i]);
}