#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{long long x,y;char ch;}a[10005];
bool cmp(node a,node b)
{
if(a.x+a.y==b.x+b.y)
return a.ch>b.ch;
return a.x+a.y>b.y+b.x;
}
int main()
{
int t,n,i;
scanf("%d",&t);
while(t--&&scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
scanf("%lld%lld",&a[i].x,&a[i].y);
if(a[i].x>a[i].y)
a[i].ch='>';
else if(a[i].x==a[i].y)
a[i].ch='=';
else
a[i].ch='<';
}
stable_sort(a,a+n,cmp);
for(i=0;i<n;i++)
printf("%lld+%lld=[%c%lld]\n",a[i].x,a[i].y,a[i].ch,a[i].x+a[i].y);
printf("\n");
}
return 0;
}
hdu 3877稳定排序
最新推荐文章于 2020-05-01 22:54:41 发布