For this Question: There are 3 points, X, Y, and Z on a road.
It takes A hours to travel from X to Y or from Y to X.
It takes B hours to travel from Y to Z or from Z to Y.
It takes C hours to travel from X to Z or from Z to X.
Newton is given the time required to travel between the points, i. e. A, B and C. He wants you to help him to calculate the minimum time needed to visit all the points once, starting from any point of your choice.The first and only line of the input contains 3 integers, A, B, and C.

<b>Constraints:</b>
1 &le; A, B, C &le; 1000Output the answer.<b>Sample Input 1:</b>
1 3 4

<b>Sample Output 1:</b>
4

<b>Sample Explanation 1:</b>
The minimum distance to travel all 3 points can be found if he starts at A and then go to B and then to C.
A - > B - > C = 1 + 3 = 4


<b>Sample Input 2:</b>
3 2 3

<b>Sample Output 2:</b>
5, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) (x).begin(), (x).end()
#define yes "Yes"
#define no "No"
#define ret return
#define xin cin
#define fix(x) fixed << setprecision(x)
#define fore(p, v) for (auto &p : v)
#define mp(a, b) make_pair(a, b)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define inf ((1LL << 62) - (1LL << 31))

int main()
{
    ll P, Q, R;
    cin >> P >> Q >> R;
    ll a = P + Q;
    ll b = Q+R;
    ll c = R+P;
    ll ans = min(a,b);
    ans = min(ans, c);
    cout << ans << endl;
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?