64,654
社区成员
发帖
与我相关
我的任务
分享
#include <stdio.h>
#include <stdlib.h>
int n,m,k,nn,mm,tjcs;
int st[1010][1010],end[1010][1010],data[1010][1010],qz[1010][1010];
struct s_node
{
int x,y,z;
int tdata[1010][1010];
}mk[110];
int cmp(const void *a,const void *b)
{
s_node *t1=(s_node *)a;
s_node *t2=(s_node *)b;
if(t1->z>t2->z)return 1;
if(t1->z<t2->z)return -1;
return 0;
}
void readMap()
{
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",&st[i][j]);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d",&end[i][j]);
scanf("%d",&k);
for(int i=1;i<=k;i++)
{
scanf("%d %d",&nn,&mm);
mk[i].x=nn;mk[i].y=mm;
for(int j=1;j<=nn;j++)
for(int l=1;l<=mm;l++)
{
scanf("%d",&mk[i].tdata[j][l]);
}
mk[i].z=nn*mm;
}
qsort(&mk[1],k,sizeof(mk[1]),cmp);
}
int main(void)
{
freopen("1.txt","r",stdin);
freopen("2.txt","w",stdout);
readMap();
return 0;
}
/*
*功能:链表排序(冒泡)
*参数:链表首地址
*/
LinkType sort(LinkType head)
{
LinkType pri, mid, tai, p;
p = head->next;
while(p != NULL)
{
mid = head->next;
if(head->data > head->next->data)
{
head->next = mid->next;
mid->next = head;
head = mid;
}
pri = head;
mid = head->next;
tai = mid->next;
while(mid->next != NULL)
{
if(mid->data > tai->data)
{
pri->next = mid->next;
mid->next = tai->next;
tai->next = mid;
}
pri = pri->next;
mid = pri->next;
tai = mid->next;
}
p = p->next;
}
return head;
}
int cmp(const void *a,const void *b)
{
s_node *t1=(s_node *)a;
s_node *t2=(s_node *)b;
if(t1->z>t2->z)return 1;
if(t1->z<t2->z)return -1;
return 0;
}
qsort(&mk[1],k,sizeof(mk[1]),cmp);