#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt")
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 3e2;
int N, L;
int X[MAXN], A[MAXN];
void init(int _N, int _L, int _X[]){
N = _N;
L = _L;
for (int i = 0; i < N; i++) X[i] = _X[i];
for (int i = 0; i < N; i++) A[i] = X[i];
sort(A, A + N);
}
int update(int pos, int val){
int ind = find(A, A + N, X[pos]) - A;
A[ind] = val;
X[pos] = val;
for (int i = 0; i < N - 1; i++){
if (A[i] > A[i + 1]) swap(A[i], A[i + 1]);
}
for (int i = N - 1; i > 1; i--){
if (A[i - 1] > A[i]) swap(A[i - 1], A[i]);
}
//for (int i = 0; i < N; i++) cerr << X[i] << ' '; cerr << endl;
//for (int i = 0; i < N; i++) cerr << A[i] << ' '; cerr << endl << endl;
int ans = 1, last = A[0];
for (int i = 0; i < N; i++){
if (A[i] - last > L){
ans++;
last = A[i];
}
}
return ans;
}
