第一周周赛Problem D三角形判断

#include
using namespace std;
int main()
{
int M;
cin >> M;
double** trigon = new double*[M];
for (int k = 0; k < M; k++)
{
trigon[k] = new double[3];
for (int j = 0; j < 3; j++)
{
cin >> trigon[k][j];
if (trigon[k][j] >= 1000) return 0;
}
}
for (int k = 0; k < M; k++)
{
if ((trigon[k][0] + trigon[k][1]) >trigon[k][2] && fabs((double)(trigon[k][0] - trigon[k][1])) < trigon[k][2])
cout << “YES” << endl;
else cout << “NO”<<endl;

}
	return 0;

}