PAT 1011

水题

#include<iostream>
#include<string>
#include<algorithm>
#include<string.h>
using namespace std;
struct FIFA {
	double W, T, L;
	char flag;
	double max;
}a[1005];

int main() {
	double max;
	for (int i = 0; i < 3; i++) {
		scanf("%lf %lf %lf", &a[i].W, &a[i].T, &a[i].L);
		if (a[i].W > a[i].T&&a[i].W > a[i].L) {
			a[i].flag = 'W';
			a[i].max = a[i].W;
		}
		else if (a[i].T > a[i].W&&a[i].T > a[i].L) {
			a[i].flag = 'T';
			a[i].max = a[i].T;
		}
		else {
			a[i].flag = 'L';
			a[i].max = a[i].L;
		}
	}
	double sum = (a[0].max*a[1].max*a[2].max*0.65-1)*2;
	printf("%c %c %c %.2lf", a[0].flag,a[1].flag,a[2].flag,sum);
	
	return 0;
}