C :

#include <stdio.h>
float ti(int a,int b,int c)
{
	return 1.0*(a+b)*c/2;
}
int main()
{
	int a[100][100];
    int n;
    float s=0;
    scanf("%d",&n);
    int i,j;
    for(i=0;i<n;i++){
    	for(j=0;j<3;j++){
    		scanf("%d",&a[i][j]);
		}
		if(s<ti(a[i][0],a[i][1],a[i][2])) s=ti(a[i][0],a[i][1],a[i][2]);
	}
	printf("%.1f",s);
    return 0;
}

C++ :

#include<bits/stdc++.h>
using namespace std;
int main(){
	double max=0;
	int n;
	cin>>n;
	int a[100][100];
	int i,j;
	for(i=0;i<n;i++){
		for(j=0;j<3;j++){
			cin>>a[i][j];
		}
	}
	double mianji;
	for(i=0;i<n;i++){
		mianji=(a[i][0]+a[i][1])*1.0*a[i][2]/2;
		if(mianji>max){
			max=mianji;
		}
	}
	cout<<fixed<<setprecision(1)<<max;
	return 0;
}

Pascal :

var a:array[1..100000] of real;
    b,c,d:array[1..100000] of longint;
    i,n:longint;
    max:real;
begin
read(n);
for i:=1 to n do
read(b[i],c[i],d[i]);
for i:=1 to n do
a[i]:=(b[i]+c[i])*d[i]/2;
for i:=1 to n do
if a[i]>max then max:=a[i];
write(max:0:1);
end.

Java :

import java.util.*;
public class Main
{
	public static void main(String[] args){ 
	    Scanner sc = new Scanner(System.in);
	    int n = sc.nextInt();
		int[][] a = new int[n][3];
		for(int i = 0;i < n;i++){
			for(int j=0;j<3;j++) {
				a[i][j]=sc.nextInt();
			}			
		}
		double [] b=new double[100];
		for(int i = 0;i < n;i++){
			   b[i] = (a[i][1]+a[i][0])*a[i][2]*1.0/2;
			}
		double max=b[0];
		for(int i=1;i<n;i++) {
			if(b[i]>max) {
				max=b[i];
			}
		}
		String x=String.format("%.1f",max);
        System.out.println(x);
 		
	}
}
		

	

Python :

class Tx:
    def __init__(self,c,k,g):
        self.c=c
        self.k=k
        self.g=g
        self.s=(c+k)*g/2
    
n=int(input())
list1=list()
for i in range(n):
    c,k,g=list(map(int,input().split()))
    list1.append(Tx(c,k,g))

list2=sorted(list1,key=lambda t:(-t.s))
print(list2[0].s)