Help me in solving MAXIMALEXP problem

help
,
1

My issue

how to handle the case when n>k?

My code

#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define pb push_back
#define vll vector<ll>
#define ln "\n"
int main(){
    ll t;
    cin >> t;
    while(t--){
        ll n,k;
        cin >> n >> k;
        if(n<=k)cout << max(n/2 , ((n+1)/2)) << ln;
        else{
                
        }
    }
}

Problem Link: MAXIMALEXP Problem - CodeChef