#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
//此凸包作用:逆时针输出凸包顶点,凸包边上的点不输出
//(要全部输出边上的点的话,暂时没想到咋办,囧)
struct point
{
int x,y;
}p[105],res[105];
double Dist(const point &arg1, const point &arg2)
{
return sqrt((double) ((arg1.x - arg2.x)*(arg1.x - arg2.x) + (arg1.y - arg2.y)*(arg1.y - arg2.y)) );
}
int multi(int i,int top,point p2,point p1,point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int mysort1(point a,point b)
{
if(a.y!=b.y) return a.y<b.y;//重大修改:下左点改为上左点
//if(a.y!=b.y) return a.y>b.y;
if(a.y==b.y&&a.x!=b.x) return a.x<b.x;
}
bool cmp(const point &a,const point &b)
{
point temp=p[0];
double xmt=(a.x-temp.x)*(b.y-temp.y)-(b.x-temp.x)*(a.y-temp.y);
if(xmt)
return xmt>0;
return Dist(a,temp)<Dist(b,temp);
}
int main()
{
int n,k,len;
cin>>k;
while(k--)
{
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i].x>>p[i].y;
sort(p,p+n,mysort1);//排序,找到最左下角的点
res[0]=p[0];
sort(p+1,p+n,cmp);//按照极角排序
res[1]=p[1];
int top=1;
for(int i=2;i<n;i++)//i=2:好把共线的点弹出去
{
while( top && multi(i,top,p[i],res[top],res[top-1])<=0)
top--;
res[++top]=p[i];
}
for(int i=0;i<=top;i++)
cout<<res[i].x<<" "<<res[i].y<<endl;
}
system("pause");
return 0;}
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
//此凸包作用:逆时针输出凸包顶点,凸包边上的点不输出
//(要全部输出边上的点的话,暂时没想到咋办,囧)
struct point
{
int x,y;
}p[105],res[105];
double Dist(const point &arg1, const point &arg2)
{
return sqrt((double) ((arg1.x - arg2.x)*(arg1.x - arg2.x) + (arg1.y - arg2.y)*(arg1.y - arg2.y)) );
}
int multi(int i,int top,point p2,point p1,point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p2.x-p0.x)*(p1.y-p0.y);
}
int mysort1(point a,point b)
{
if(a.y!=b.y) return a.y<b.y;//重大修改:下左点改为上左点
//if(a.y!=b.y) return a.y>b.y;
if(a.y==b.y&&a.x!=b.x) return a.x<b.x;
}
bool cmp(const point &a,const point &b)
{
point temp=p[0];
double xmt=(a.x-temp.x)*(b.y-temp.y)-(b.x-temp.x)*(a.y-temp.y);
if(xmt)
return xmt>0;
return Dist(a,temp)<Dist(b,temp);
}
int main()
{
int n,k,len;
cin>>k;
while(k--)
{
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i].x>>p[i].y;
sort(p,p+n,mysort1);//排序,找到最左下角的点
res[0]=p[0];
sort(p+1,p+n,cmp);//按照极角排序
res[1]=p[1];
int top=1;
for(int i=2;i<n;i++)//i=2:好把共线的点弹出去
{
while( top && multi(i,top,p[i],res[top],res[top-1])<=0)
top--;
res[++top]=p[i];
}
for(int i=0;i<=top;i++)
cout<<res[i].x<<" "<<res[i].y<<endl;
}
system("pause");
return 0;}