fork download
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <algorithm>
  4. #include <vector>
  5. #include <string>
  6. #include <cmath>
  7. #include <cstdlib>
  8. #include <cstring>
  9. #include <map>
  10. #include <iterator>
  11. #include <cctype>
  12. using namespace std;
  13.  
  14. int main()
  15. {
  16. //freopen("A-large-practice.in","r",stdin);
  17. //freopen("output.txt","w",stdout);
  18. int n;
  19. scanf("%d",&n);
  20.  
  21. for (int t = 1; t <= n; t++) {
  22. int size;
  23. scanf("%d",&size);
  24. vector<int> v1,v2;
  25.  
  26. for (int i=0;i<size;i++) {
  27. int a;
  28. cin >> a;
  29. v1.push_back(a);
  30. }
  31.  
  32. for (int i=0;i<size;i++) {
  33. int a;
  34. cin >> a;
  35. v2.push_back(a);
  36. }
  37.  
  38. sort(v1.begin(),v1.end());
  39. sort(v2.begin(),v2.end());
  40. reverse(v2.begin(),v2.end());
  41.  
  42. long long product=0;
  43. for (int i = 0; i < size; i++) {
  44. product += (long long)v1[i]*(long long)v2[i];
  45. }
  46.  
  47. printf("Case #%d: %lld\n",t,product);
  48. }
  49. }
  50.  
Success #stdin #stdout 0s 3420KB
stdin
2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1
stdout
Case #1: -25
Case #2: 6