Xenia and Colorful Gems(sort/指针)

题目
给定3个数组，求 m i n ( ( r i − g j ) 2 + ( r i − b k ) 2 + ( g j − b k ) 2 ) min((r_i-g_j)^2+(r_i-b_k)^2+(g_j-b_k)^2) min((ri​−gj​)2+(ri​−bk​)2+(gj​−bk​)2)
排序后暴力枚举，每次枚举中间值，不漏情况。

#include
using namespace std;
#define ll long long

int nr,ng,nb;
ll sq(int x) {
	return 1LL*x*x;
}
ll ans;
void solve(vector &r,int &nr,vector &g,int &ng,vector &b,int &nb) {
	int i = 0,j = 0,k = 0;
	//bk