#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

#include<atcoder/all>

void solve() {
  int n,k;
  cin>>n>>k;
  vector<int> a(n);
  rep(i,0,n) cin>>a[i];
  ll ans=0;
  vector<ll> v(n);
  rep(i,0,n){
    if(a[i]>k){
      ans+=(a[i]+1)/2;
      v[i]=-(a[i]&1);
    }else{
      v[i]=a[i];
    }
  }
  sort(v.begin(),v.end());
  reverse(v.begin(),v.end());
  for(int i=0;i<n;i+=2) ans+=v[i];
  cout<<ans<<"\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}