题目地址:https://www.luogu.org/problemnew/show/P1056
题目有n对上课说话的同学(座位固定),让你利用行列的走廊把他们分隔开。题目非常简单,利用的是结构体排序。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<algorithm>
#include<cmath>
using namespace std;
struct data
{
int sum,ans;
}a[2001],b[2001];
bool cmp1(data n1,data n2)
{
return n1.ans<n2.ans;
}
bool cmp2(data n1,data n2)
{
return n1.sum>n2.sum;
}
int main()
{
int m,n,maxn,k,l,d,i,x1,x2,y1,y2,minn;
scanf("%d%d%d%d%d",&m,&n,&k,&l,&d);
maxn=max(n,m);
for(i=1;i<maxn+1;i++)
{
a[i].ans=b[i].ans=i;
a[i].sum=b[i].sum=0;
}
for(i=0;i<d;i++)
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
if(x1==x2&&fabs(y1-y2)==1)
{
minn=min(y1,y2);
b[minn].sum++;
}
if(y1==y2&&fabs(x1-x2)==1)
{
minn=min(x1,x2);
a[minn].sum++;
}
}
sort(a+1,a+m+1,cmp2);
sort(b+1,b+n+1,cmp2);///先行列按大小排 再按行列序号排
sort(a+1,a+k+1,cmp1);
sort(b+1,b+l+1,cmp1);
for(i=1;i<=k;i++)
{
if(i==k)
printf("%d\n",a[i].ans);
else
printf("%d ",a[i].ans);
}
for(i=1;i<=l;i++)
{
if(i==l)
printf("%d\n",b[i].ans);
else
printf("%d ",b[i].ans);
}
return 0;
}