For this Question: Given two positive integers B and A, find the smallest integer height such that there exists a Triangle with base B and area atleast A.The first line of input contains a single integer T, denoting the number of testcases. Each test case contains only one line i.e. B(base) and A(area) separated by space.

Constraints:
1 <= T <= 10
1 <= B <= 100000
1 <= A <= 100000For each testcase in new line you need to print the minimum height of triangle with base B and area atleast A.Input:
2
2 2
17 100

Output:
2
12, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;



// Driver code
int main()
{

int t;
cin>>t;
while(t--){
    long long x,y;
    cin>>x>>y;
    y=y*2;
    long long p=y/x;
    if(y%x!=0){p++;}
    cout<<p<<endl;

}
 }
, In this Programming Language: C++, Now tell me if this Code is compilable or not?