A The warm love problem

链接：https://ac.nowcoder.com/acm/contest/7528/A
来源：牛客网

题目描述
A learns how to make A table from B. B gives A four sticks in order to check A’s learning results. The lengths are a1, a2, a3, and a4. B asked A if he could use the four sticks as pillars to support the table, so as to keep the table stable, that is, the table just meets the four sticks at the same time. The table is A rectangular board of arbitrary size.
输入描述:

• Line 1 : An integer T.(Includes T group test samples 1<=T<=100000).
• Line 2…N+1: Each line contains 4 integers,a1 ,a2 ,a3 ,a4(1<= ai <=1e9).
  输出描述:
  For each set of test samples, output “YES” or “NO”,depending on it is possible to make a table with the given design or not.
  示例1
  输入
  复制
  4
  1 1 1 1
  1 5 1 5
  1 3 2 2
  9 5 11 8
  输出
  复制
  YES
  YES
  YES
  NO
  备注:
  Your table should have four legs

代码：

#include<bits/stdc++.h>
using namespace std;
#define sc(a) scanf("%d",&a)
#define ll long long int 
int main()
{
	int t;
	sc(t);
	ll a[4]={0};
	while(t--)
	{
		cin>>a[0]>>a[1]>>a[2]>>a[3];
		sort(a,a+4);
		if(a[2]+a[1]==a[0]+a[3])
		puts("YES");
		else 
		puts("NO");
	}
 } ```