Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct all
- {
- pair <int ,int > p;
- int l;
- };
- int main()
- {
- int t;
- scanf("%d",&t);
- while(t--)
- {
- int n;
- int mini=10001000,mx=-1;
- scanf("%d",&n);
- all array[n];
- for(int i=0;i<n;i++)
- {
- scanf("%d%d",&all[i].p.first,&all[i].p.second);
- all[i].l = all[i].p.first*all[i].p.first+all[i].p.second*all[i].p.second;
- mx = max(mx,all[i]);
- mini = min(mini,all[i]);
- }
- cout<<mx<<" "<<mini<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement