PAT 1011. World Cup Betting (20)

#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<stack>
using namespace std;
#define INF 100000000
#define min(a,b) a<b?a:b
struct odd{
double value;
char s;

}a[3][3],max1[3];

int main()
{
int n;
n=3;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{scanf("%lf",&a[i][j].value);

if(j==0)
a[i][j].s='W';
else if(j==1)
a[i][j].s='T';
else
a[i][j].s='L';
}

for(int i=0;i<n;i++)
{
max1[i].value=a[i][0].value;
max1[i].s=a[i][0].s;
for(int j=1;j<n;j++)
if(a[i][j].value>max1[i].value)
{
max1[i].value=a[i][j].value;
max1[i].s=a[i][j].s;
}

}
double t=max1[0].value*max1[1].value*max1[2].value;
/*  for(int i=0;i<n;i++)
if(max1[i].s=='W')
t*=0.65;*/
double sum=(t*0.65-1)*2;
printf("%c %c %c %.2lf\n",max1[0].s,max1[1].s,max1[2].s,sum);
return 0;
}