听取WA声一片

#include <iostream>
#include <algorithm>
using namespace std;
int n,m,a[5005],minn;
int main(){
    cin>>n>>m;
    for (int i=1;i<=m;i++){
    	cin>>a[i];
	}
    sort(a+1,a+1+m);
    for (int i=1;i<=m;i++){
    	minn=max(minn,min(a[i],n+1-a[i]));
	}
    cout<<minn<<" "<<max(n+1-a[1],a[m]);
    return 0;
}

大佬求助，必关