除了三个超时的剩下的全部都过了

#include <stdio.h>
#include <math.h>
long long result=9999999999999,qaq[110000],qwq[110000],xiabiao[110000];
long long juli(long long x1, long long y1, long long x2, long long y2)
{
	long long len=((x1-x2)* (x1 - x2) + (y1 - y2)*(y1-y2));	
	return len;
}
long long main()
{
	long long n,x1, y1, x2, y2;
	scanf("%lld%lld%lld%lld", &x1, &y1, &x2, &y2);
	scanf("%lld", &n);
	long long x=0, y=0,q,p;
	for (long long i = 0; i < n; i++)
	{
		scanf("%lld%lld", &x, &y);
		qaq[i] = juli(x1, y1, x, y);//到1
		//尝试保存下标
		xiabiao[i] = i;
		qwq[i] = juli(x2, y2, x, y);//到2
	}
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			if (qaq[i] < qaq[j])
			{
				int tem = qaq[i];
				qaq[i] = qaq[j];
				qaq[j] = tem;
				int s = qwq[i];
				qwq[i] = qwq[j];
				qwq[j] = s;
			}//排序,使得两组数据始终对应相等
		}//qaq是所有导弹到第一个系统的距离数组,qaq是所有导弹到第二个系统的距离数组
	}
	//qaq已经升序了
	int max = 0,sum=0;
	for (int i = 0; i < n; i++)
	{
		sum = 0;
		int j = i - 1;
		if(j>=0)//防止刚开始的时候j是-1
			if (qwq[j] > max)
				max = qwq[j];//更新最大值		
		sum = max + qaq[i];
		if (sum < result)
			result = sum;
	}
	printf("%lld", result);
	return 0;
}