fork download
  1. #include<iostream>
  2. #include<algorithm>
  3. #include<cmath>
  4. #include<climits>
  5.  
  6. using namespace std;
  7.  
  8. bool sortbysec(const pair<long long int,long long int> &a,
  9. const pair<long long int,long long int> &b)
  10. {
  11. return (a.second < b.second);
  12. }
  13.  
  14. int main()
  15. {
  16. int t;
  17. cin >> t;
  18. while(t--)
  19. {
  20. int n;
  21. cin >> n;
  22. pair <long long int,long long int> points[n];
  23. for(int i=0 ; i<n ; i++)
  24. {
  25. long long int x,y;
  26. cin >> x >> y;
  27. points[i] = make_pair(x-y,x+y);
  28. }
  29. sort(points,points+n);
  30. long long int curr_min = INT_MAX;
  31. for(int i=1 ; i<n ; i++)
  32. {
  33. curr_min = min(curr_min,points[i].first - points[i-1].first);
  34. }
  35. sort(points,points+n,sortbysec);
  36. for(int i=1 ; i<n ; i++)
  37. {
  38. curr_min = min(curr_min,points[i].second - points[i-1].second);
  39. }
  40. cout.precision(30);
  41. cout<<double(curr_min)/2.0 << "\n";
  42. }
  43. }
  44.  
Success #stdin #stdout 0s 15240KB
stdin
Standard input is empty
stdout
1073741823.5
1073741823.5