Advertisement
Guest User

Untitled

a guest
Mar 23rd, 2018
75
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. struct all
  4. {
  5. pair <int ,int > p;
  6. int l;
  7. };
  8. int main()
  9. {
  10. int t;
  11. scanf("%d",&t);
  12. while(t--)
  13. {
  14. int n;
  15. int mini=10001000,mx=-1;
  16. scanf("%d",&n);
  17. all array[n];
  18. for(int i=0;i<n;i++)
  19. {
  20. scanf("%d%d",&all[i].p.first,&all[i].p.second);
  21. all[i].l = all[i].p.first*all[i].p.first+all[i].p.second*all[i].p.second;
  22. mx = max(mx,all[i]);
  23. mini = min(mini,all[i]);
  24. }
  25. cout<<mx<<" "<<mini<<endl;
  26. }
  27. return 0;
  28. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement