1 : 1 按 照 题 解 编 程 W A 8 个

在这道题上已被困2个月 求各位神犇帮蒟蒻看一下有什么错误!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

#include<bits/stdc++.h>
using namespace std;

int m, n;
int bmy=0;
int gf[100050], lqx[100050];

int main()
{
    scanf("%d%d", &m, &n);
    for (int i = 0; i <= m-1; i++)
        scanf("%d", &lqx[i]);
    for (int i = 0; i <= n-1; i++)
        scanf("%d", &gf[i]);
    sort(lqx, lqx+n);
    for (int i = 0; i <= m-1; i++)
    {
        int l=0, r=n, mid;
        while (l < r)
        {
            mid = (l+r)/2;
            lqx[mid] <= gf[i] ? l = mid+1 : r = mid;
        }
        gf[i] <= lqx[0] ? bmy += lqx[0] - gf[i] : bmy += min(abs(lqx[l-1]-gf[i]), abs(lqx[l]-gf[i]));
    }
    printf("%d", bmy);
    return 0;
}