cf1337D

题意

思路

把三种数字都按从小到大顺序排起来，然后枚举每一个球球，看看它左边最近的和右边最近的！

代码

```cpp
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long 
using namespace std;
const int INF = 0x3f3f3f3f3f3f3f3f;
int cal(int a,int b,int c){
	return (a-b)*(a-b)+(a-c)*(a-c)+(b-c)*(b-c);
} 
int a1[10];
int cnt[5][100010];
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		cin>>a1[1]>>a1[2]>>a1[3];
		for(int i=1;i<=3;i++){
			for(int j=1;j<=a1[i];j++){
				cin>>cnt[i][j];
			}
			sort(cnt[i]+1,cnt[i]+a1[i]+1);
		}
		int ans=INF; 
		for(int i=1;i<=3;i++){
			for(int j=1;j<=3;j++){
				if(i==j) continue;
				int k=6-i-j;
				for(int p=1;p<=a1[i];p++){
					int l=upper_bound(cnt[j]+1,cnt[j]+1+a1[j],cnt[i][p])-cnt[j]-1;
					int r=lower_bound(cnt[k]+1,cnt[k]+1+a1[k],cnt[i][p])-cnt[k];
					if(r==a1[k]+1||l==0) continue;
					ans=min(ans,cal(cnt[j][l],cnt[i][p],cnt[k][r]));
				}
			}
		}
		cout<<ans<<endl;
	}
    return 0;
}