K - Symmetry

The figure shown on the left is left-right symmetric as it is possible to fold the sheet of paper along a vertical line, drawn as a dashed line, and to cut the figure into two identical halves. The figure on the right is not left-right symmetric as it is impossible to find such a vertical line.
Write a program that determines whether a figure, drawn with dots, is left-right symmetric or not. The dots are all distinct.
Input
The input consists of T test cases. The number of test cases T is given in the first line of the input file. The first line of each test case contains an integer N, where N (1 ≤ N ≤ 1,000) is the number of dots in a figure. Each of the following N lines contains the x-coordinate and y-coordinate of a dot. Both x-coordinates and y-coordinates are integers between −10,000 and 10,000, both inclusive.
Output
Print exactly one line for each test case. The line should contain ‘YES’ if the figure is left-right symmetric, and ‘NO’, otherwise.
Sample Input
3

5

-2 5

0 0

6 5

4 0

2 3

4

2 3

0 4

4 0

0 0

4

5 14

6 10

5 10

6 14
Sampl

YES

NO

YES

根据中间找对称，用暴力方法就可以通过，开一个结构体数组，然后存储横纵坐标，然后找到最大的横坐标和最小的横坐标，然后对称轴如果存在的话，一定是在二者之间。如果不存在的话就输出no就可以了，终点是你需要排序上面花一些心思。

#include<stdio.h>
#include<iostream>
using namespace std;
#include<string.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<math.h>
#include<set>
using namespace std;
int t,n,l,r,ans;
struct node
{
    int x,y;
};
node s[1010],x[1010];
bool cmp1(node a,node b)
{
    if(a.x==b.x)
        return a.y>b.y;
    return a.x<b.x;
}
bool cmp2(node a, node b)
{
    if(a.x==b.x)
        return a.y>b.y;
    return a.x>b.x;
}
bool check()
{
    for(int i=0;i<n;i++)
    {
        if(s[i].x+x[i].x!=ans)
            return 0;
        else if(s[i].y!=x[i].y)
            return 0;
    }
    return 1;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        int a,b;
        l=10010;
        r=-10010;
        for(int i=0; i<n; i++)
        {
            scanf("%d%d",&a,&b);
            s[i].x=x[i].x=a;
            s[i].y=x[i].y=b;
            if(a<l)
                l=a;
            if(a>r)
                r=a;
        }
        sort(s,s+n,cmp1);
        sort(x,x+n,cmp2);
        ans=l+r;
        if(check())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}