题解 | #Grading#

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;

int main() {
    int P,T,G1,G2,G3,GJ;
    while (scanf("%d %d %d %d %d %d",&P,&T,&G1,&G2,&G3,&GJ) != EOF) {
        int a = abs(G1-G2);
        double grade = 0;
        if (a <= T) {
            grade = (double)(G1 + G2) / 2;
        }else {
            int b = abs(G3 - G1);
            int c = abs(G3 - G2);
            if (b <= T && c <= T) {
                grade = max(max(G1, G2),G3);
            }else if (b <= T || c <= T) {
                grade = (double)(G3 + (b > c ? G2 : G1)) / 2;
            }else {
                grade = GJ;
            }
        }
        printf("%.1f\n",grade);
    }
}