Saleh127

Untitled

May 15th, 2020
139
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define ll long long int
  5. #define sc(a) scanf("%lld",&a)
  6. #define pf(a) printf("%lld",a)
  7. #define sc2(a,b) scanf("%lld %lld",&a,&b)
  8. int main()
  9. {
  10. ll t,i,j,k,x,c,m,d;
  11. cin>>t;
  12. for(x=1;x<=t;x++)
  13. {
  14. cin>>c;
  15. vector <pair<ll, ll> > a;
  16. for(i=0;i<c;i++)
  17. {
  18. cin>>m>>d;
  19. a.push_back(make_pair(m,d));
  20. }
  21. sort(a.begin(),a.end());
  22. double ans=0.00;
  23. for(i=0;i<c;i++)
  24. {
  25. ll ttime=a[i+1].first-a[i].first;
  26. ll distanc=abs(a[i+1].second-a[i].second);
  27. double l=(double)distanc/ttime;
  28. ans=max(ans,l);
  29. }
  30. printf("Case #%lld: %.2lf\n",x,ans);
  31. }
  32. return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment