What is wrong with this algorithm?

#	User	Rating
1	jiangly	3810
2	Benq	3676
3	Kevin114514	3655
4	maroonrk	3463
5	strapple	3447
6	Um_nik	3387
7	heuristica	3322
8	turmax	3317
9	tourist	3307
10	jiangbowen	3291

#	User	Contrib.
1	Qingyu	156
2	nik_exists	150
2	maspy	150
4	Um_nik	141
5	Errichto	139
6	adamant	137
7	AmShZ	135
8	BledDest	132
9	maroonrk	131
10	qwexd	129

Problem: Array Game — https://codeforces.me/contest/1904/problem/C Idea of the code, consider all possible combinations of 2 elements to make diff, mn = min of, mn, diff, [first element greater than diff]-diff, [one element left of the first element greater than diff]-diff. Thanks so much.

My Code

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pair<int,int>>

using namespace std;

void solve(){
    int n,k;
    cin >> n >> k;
    vi a(n);
    for(int i=0;i<n;i++){
        cin >> a[i];
    }
    if(k >= 3){
        cout << "0\n";
        return;
    }
    sort(a.begin(), a.end());
    if(k==2){
        int mn = a[0];
        for(int i=0;i<n-2;i++){
            for(int j=1; j+i <n; j++){
                int diff = a[i+j]-a[i];
                int l=0, r=n-1;
                while(l<=r){
                    int mid = l +(r-l)/2;
                    if(a[mid]<=diff){
                        l = mid+1;
                    } else{
                        r = mid-1;
                    }
                }
                if(r>=0) {
                    mn = min(mn, diff-a[r]);
                }
                if(r+1<n) {
                    mn = min(mn, a[r+1] - diff);
                }
                mn = min(mn, diff);
            }
        }
        cout << mn << "\n";

    }
    if(k==1){
        int mn = a[0];
        for(int i=0;i<n-1;i++){
            mn = min(mn, a[i+1]-a[i]);
        }
        cout << mn << "\n";
        return;
    }

}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}