Create HW5TSP.cpp

There are n cities and a salesman needs to visit every city and return to the city he started from.
The Traveling Salesman Problem (TSP) is to solve for the optimal route with the shortest possible
total length. You task is to write a C++ program TSP.cpp which, given the coordinates of n cities
and a total distance D, computes and prints Yes if there exists a route with total distance of at most
D, and prints No if such route does not exist. Your program should get its input from cin. The
input is a sequence of 2n + 1 real numbers in the order of D, x1, y1, . . . , xn, yn, where (xi
, yi) is the
coordinate of the i-th city (a city can be regarded as a single point which has no area). The distance
between any two cities (x1, y1) and (x2, y2) is their Euclidean distance d =
√
(x1 − x2)
2 + (y1 − y2)
2.
Example runs of valid input arguments are (the first line is the command line, the second line is
the input and the third line is the expected output of your program).