2021/1/9 購買力

//C language
//solution link(含註解): 

#include<stdio.h>
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
int main(){
    int n,d;
    scanf("%d%d",&n,&d);
    int sum=0,count=0;
    for(int i=0;i<n;i++){
        int a[4];
        scanf("%d%d%d",&a[0],&a[1],&a[2]);
        if(max(a[0],max(a[1],a[2]))-min(a[0],min(a[1],a[2]))>=d){
            count++;
            sum+=(a[0]+a[1]+a[2])/3;
        }
    }
    printf("%d %d\n",count,sum);
    return 0;
}

//C++ language
//solution link(含註解): 

#include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int n,d;
    cin>>n>>d;
    int sum=0,count=0;
    for(int i=0;i<n;i++){
        int a,b,c;
        cin>>a>>b>>c;
        if(max(a,max(b,c))-min(a,min(b,c))>=d){
            count++;
            sum+=(a+b+c)/3;
        }
    }
    cout<<count<<" "<<sum<<"\n";
    return 0;
}

## Python language
## solution link(含註解): 

n,d=map(int,input().split())
def average(price):
    return sum(price)//3
Sum=count=0
for i in range(n):
    price=[int(x) for x in input().split()]
    if max(price)-min(price)>=d:
        count+=1
        Sum+=average(price)
print(count,Sum)