730B - Minimum and Maximum - CodeForces Solution

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <iomanip>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first 
#define sc second 
#define mod 1000000007
using namespace std;
int main() 
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    //std::ios::sync_with_stdio(false);
    vector<int> big,small;
    int n,t,mn,mx;
    char c;
    cin>>t;
    rep(w,t)
    {
        big.clear();
        small.clear();
        cin>>n;
        for(int i=1;i<n;i+=2)
        {
            cout<<"? "<<i<<' '<<i+1<<endl;
            cin>>c;
            if(c=='<')
            {
                small.push_back(i);
                big.push_back(i+1);
            }
            
            else
            {
                small.push_back(i+1);
                big.push_back(i);
            }
            
        }
        if(n%2==1)
        {
            small.push_back(n);
            big.push_back(n);
        }
        mn=small[0];
        rep(i,small.size()-1)
        {
            cout<<"? "<<mn<<' '<<small[i+1]<<endl;
            cin>>c;
            if(c=='>')mn=small[i+1];
        }
        mx=big[0];
        rep(i,big.size()-1)
        {
            cout<<"? "<<mx<<' '<<big[i+1]<<endl;
            cin>>c;
            if(c=='<')mx=big[i+1];
        }
        cout<<"! "<<mn<<' '<<mx<<endl;
    }
    return 0;
}