UVA 10714

#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <stdlib.h>using namespace std;#define MAXN 1000000 + 10int pos[MAXN];int main(){   int t;   scanf("%d",&t);   while(t--)   {       int len, n;       int ans1, ans2, minn, maxn;       ans1 = ans2 = 0;       scanf("%d %d",&len, &n);       for(int i = 0; i < n ;i++)         scanf("%d", &pos[i]);       sort(pos, pos + n);       for(int i = 0; i < n ;i ++)       {           minn = min(pos[i], len - pos[i]);           maxn = max(pos[i], len - pos[i]);           ans1 = max(ans1, minn);           ans2 = max(ans2, maxn);       }       printf("%d %d\n",ans1, ans2);   }   return 0;}