#include<bits/stdc++.h> using namespace std; int main() {int x=0,y=0,z=0,k=0,n=1,m=0,a[101],b[101],c[101]; while(k<=n) {cin>>a[k]>>b[k]>>c[k];if(m==0){cin>>n;m=1;} k++; } x=a[0];y=b[0];z=c[0]; sort(a+0,a+k); sort(b+0,b+k); sort(c+0,c+k); cout<<a[k-1]-x<<" ";cout<<b[k-1]-y<<" "; cout<<c[k-1]-z; }

C++ :

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
using namespace std;
struct scorre{
    int yw,sx,yy;
};
int main()
{
    scorre xiaoming;
    scanf("%d",&xiaoming.yw);
    scanf("%d",&xiaoming.sx);
    scanf("%d",&xiaoming.yy);
    int n,a,b,c,sum1,sum2,sum3,cha1=0,cha2=0,cha3=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a);
        sum1=(xiaoming.yw)-a;
        if(sum1>=0)sum1=0;
        if(sum1<cha1)cha1=sum1;
        scanf("%d",&b);
        sum2=(xiaoming.sx)-b;
        if(sum2>=0)sum2=0;
        if(sum2<cha2)cha2=sum2;
        scanf("%d",&c);
        sum3=(xiaoming.yy)-c;
        if(sum3>=0)sum3=0;
        if(sum3<cha3)cha3=sum3;
    }
    printf("%d\n%d\n%d",-1*cha1,-1*cha2,-1*cha3);
    return 0;
}