For this Question: Kiran insures his vehicle. According to the insurance policy : the highest rebatable sum for any damage is X dollars, and if the amount required for fixing the damage is &le; X dollars then the entire payment is rebated. His bike met with an accident, the repairs cost Y dollars. Calculate the amount that the insurance provider will rebate.The first line of input will contain a single integer T, denoting the number of test cases. The first and only line of each test case contains two space- separated integers X and Y.

<b>Constraints</b>
1 &le; T &le; 1000
1 &le; X, Y &le; 30For each test case, output the amount that will be rebated by the insurance company.Sample Input :
4
5 3
5 8
4 4
15 12
Sample Output :
3
5
4
12, I have written this Solution Code: #include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif

#define int long long

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) {
    uniform_int_distribution<int64_t> generator(l, r);
    return generator(rng);
}

// operator overload of << for vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for (const auto &x : v)
        os << x << " ";
    return os;
}

int32_t main() {
    ios_base::sync_with_stdio(true);
    cin.tie(nullptr);
    cout.tie(nullptr);
    auto start = std::chrono::high_resolution_clock::now();

    int t, x, y;
    cin >> t;
    while (t--) {
        cin >> x >> y;
        if (x >= y) {
            cout << y << endl;
        } else {
            cout << x << endl;
        }
    }

    auto stop = std::chrono::high_resolution_clock::now();
    auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(stop - start);
    cerr << "Time taken : " << ((long double)duration.count()) / ((long double)1e9) << "s\n";
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?