HostelVisit.cpp

#include "bits/stdc++.h"
 
using namespace std;
 
#define  f first
#define  lgn 25
#define  endl '\n'
#define  sc second
#define  N (int)2e5+5
#define  sz(x) x.size()
#define  int long long int
#define  ld long double
#define  vi vector<int>
#define  vs vector<string>
#define  vc vector<char>
#define  mii map<int,int>
#define  pii pair<int,int>
#define  vpii vector<pii>
#define  test(x) while(x--)
#define  pb push_back
#define  eb emplace_back
#define  pq priority_queue
#define  mod 1000000007
#define  fo(i,a,n) for(int i=a;i<n;i++)
#define  rfo(i,n,a) for(int i=n;i>=a;i--)
#define  mst(a,v,n) fo(i,0,n) a[i]=v
#define  all(x) begin(x),end(x)
#define  allr(x) rbegin(x),rend(x)
#define  rev(x) reverse(begin(x),end(x))
#define  db(x) cout<<#x <<" : "<< x <<endl;
#define time() cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n"
 
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
 
int n,m,q,k;
vi adj[N];
int vis[N],par[N];
pii a[N];
mii mp;
pq <int,vi,less<int> > pp;
 
// bool operator > (map<int,int>::iterator &x , map<int,int>:: iterator &y)
// {
//     return x>y;
// }
int dis(int x,int y)
{
    return x*x + y*y;
}
void go()
{
    cin>>q>>k;
    fo(i,0,q)
    {
        int ch,x,y;
        cin>>ch;
        if(ch==1)
        {
            cin>>x>>y;
            int distance=dis(x,y);
            pp.push(distance);
            if(sz(pp) > k) pp.pop();
        }
        else
        {
           cout<<pp.top()<<endl;
 
        }
    }
 
 
}
 
int32_t main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t=1; 
    // cin>>t;
    test(t) go();
}