#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];
  vector<ll> v(2);
  vector<int> t1,t2;
  rep(i,0,n){
    if(a[i]>k) t2.push_back(a[i]);
    else t1.push_back(a[i]);
  }
  sort(t1.begin(),t1.end());
  sort(t2.begin(),t2.end());
  {
    int ct=0;
    while(!t1.empty()){
      v[ct]+=t1.back();
      t1.pop_back();
      ct^=1;
    }
    while(!t2.empty()){
      ll t=t2.back();
      t2.pop_back();
      ll d=t/2;
      v[ct]+=d;
      v[ct^1]+=t-d;
      ct^=1;
    }
  }
  cout<<v[0]<<"\n";
}

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