include[HTML_REMOVED]
using namespace std;
const int N = 10000;
int q[N],tmp[N];
[HTML_REMOVED]
void quick_sort(int q[],int l ,int r)
{
if(l>=r) return;
int i = l -1,j = r + 1;
int x = q(l +r>>1);
while(i[HTML_REMOVED]x);
if(i<j) swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
[HTML_REMOVED]
void merge_sort(int q[],int l ,int r)
{
if(l>= r) return;
int mid = l +r;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
int k = 0,i = l, j = mid + 1;
while(i<=mid && j<=r)
{
if(q[i]<q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while(i<=mid) tmp[k++] = q[i++];
while(j<=r) tmp[k++] = q[j++];
for(int i = l,j = 0; i<r ;i++,j++) q[i] = tmp[j];
}
[HTML_REMOVED]
int check(int x);
[HTML_REMOVED]
int bsearch_1(int l,int r)
{
while(l[HTML_REMOVED]>1;
if(check(x)) r = mid;
else l = mid + 1;
}
return l;
}
[HTML_REMOVED]
int bsearch_2(int l,int r)
{
while(l[HTML_REMOVED]>1;
if(check(x)) l = mid ;
else r = mid -1;
}
return l;
}