fork download
  1. #include <stdio.h>
  2.  
  3. enum Sort {
  4. ASCENDING,
  5. DESCENDING
  6. };
  7.  
  8. void f(int arr[], int n, enum Sort order) {
  9. for (int i = 0; i < n - 1; i++) {
  10. for (int j = 0; j < n - i - 1; j++) {
  11. if ((order == ASCENDING && arr[j] > arr[j + 1]) || (order == DESCENDING && arr[j] < arr[j + 1])) {
  12. int temp = arr[j];
  13. arr[j] = arr[j + 1];
  14. arr[j + 1] = temp;
  15. }
  16. }
  17. }
  18. }
  19.  
  20. int main() {
  21. int N;
  22. scanf("%d", &N);
  23.  
  24. int A[N], B[N];
  25. for (int i = 0; i < N; i++) {
  26. scanf("%d", &A[i]);
  27. }
  28. for (int i = 0; i < N; i++) {
  29. scanf("%d", &B[i]);
  30. }
  31.  
  32.  
  33. f(A, N, ASCENDING);
  34. f(B, N, DESCENDING);
  35.  
  36. // S 값을 계산
  37. int S = 0;
  38. for (int i = 0; i < N; i++) {
  39. S += A[i] * B[i];
  40. }
  41.  
  42. printf("%d\n", S);
  43.  
  44. return 0;
  45. }
  46.  
Success #stdin #stdout 0.01s 5300KB
stdin
5
1 1 1 6 0
2 7 8 3 1
stdout
18