1 solutions

  • 0
    @ 2025-11-5 19:06:33

    C :

    #include<stdio.h>
    #include<math.h>
    
    
    int main()
    {
    	int  a,b;
    	int i,j;
    	scanf("%d%d",&a,&b);
    
    	int c[500][2];
    	int d;
    	d=a+b;
    	for(i=0;i<d;i++)
    	{
    		scanf("%d",&c[i][0]);
    		scanf("%d",&c[i][1]);
    	}
    	
        int flag=500;
    	int p;
    	
    	for(i=0;i<d;i++)
    	{
    	 for(j=0;j<d;j++)
    	 {
    		if(flag>c[j][0])
    		{
    			flag=c[j][0];	p=j;
    		}
    	 }
    	printf("%d %d\n",c[p][0],c[p][1]);
    	flag=500;
    	c[p][0]=500;
    	}
    
    
    	return 0;
    }
    

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    struct f
    {
        int a,b;
    }a[100000];
    bool cmp(f a,f b)
    {
        return a.a<b.a;
    }
    int n,m;
    int main()
    {
        cin>>n>>m;
        for(int i=1;i<=n+m;i++)
        cin>>a[i].a>>a[i].b;
        sort(a+1,a+n+m+1,cmp);
        for(int i=1;i<=n+m;i++)
        cout<<a[i].a<<" "<<a[i].b<<"\n";
        return 0;
    }
    
    • 1

    C语言程序设计教程(第三版)课后习题11.8

    Information

    ID
    19178
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By