Codeforces Round #134 (Div. 2)A. Mountain Scenery

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;

const int N = 1000;

int main()
{
int n,k;
int a
;
cin>>n>>k;
for(int i=0;i<=2*n;i++)
{
cin>>a[i];
}
for(int i=0;i<=2*n;i++)
{
if(k && i%2==1 && a[i]-a[i-1]>1 && a[i]-a[i+1]>1)
{
a[i]--;
k--;
}
cout<<a[i]<<' ';
}
return 0;
}