#include <stdio.h>
enum Sort {
ASCENDING,
DESCENDING
};
void f(int arr[], int n, enum Sort order) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if ((order == ASCENDING && arr[j] > arr[j + 1]) || (order == DESCENDING && arr[j] < arr[j + 1])) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
int N;
int A[N], B[N];
for (int i = 0; i < N; i++) {
}
for (int i = 0; i < N; i++) {
}
f(A, N, ASCENDING);
f(B, N, DESCENDING);
// S 값을 계산
int S = 0;
for (int i = 0; i < N; i++) {
S += A[i] * B[i];
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgplbnVtIFNvcnQgewogICAgQVNDRU5ESU5HLAogICAgREVTQ0VORElORwp9OwoKdm9pZCBmKGludCBhcnJbXSwgaW50IG4sIGVudW0gU29ydCBvcmRlcikgewogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuIC0gMTsgaSsrKSB7CiAgICAgICAgZm9yIChpbnQgaiA9IDA7IGogPCBuIC0gaSAtIDE7IGorKykgewogICAgICAgICAgICBpZiAoKG9yZGVyID09IEFTQ0VORElORyAmJiBhcnJbal0gPiBhcnJbaiArIDFdKSB8fCAob3JkZXIgPT0gREVTQ0VORElORyAmJiBhcnJbal0gPCBhcnJbaiArIDFdKSkgewogICAgICAgICAgICAgICAgaW50IHRlbXAgPSBhcnJbal07CiAgICAgICAgICAgICAgICBhcnJbal0gPSBhcnJbaiArIDFdOwogICAgICAgICAgICAgICAgYXJyW2ogKyAxXSA9IHRlbXA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgaW50IE47CiAgICBzY2FuZigiJWQiLCAmTik7CgogICAgaW50IEFbTl0sIEJbTl07CiAgICBmb3IgKGludCBpID0gMDsgaSA8IE47IGkrKykgewogICAgICAgIHNjYW5mKCIlZCIsICZBW2ldKTsKICAgIH0KICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSB7CiAgICAgICAgc2NhbmYoIiVkIiwgJkJbaV0pOwogICAgfQoKCiAgICBmKEEsIE4sIEFTQ0VORElORyk7CiAgICBmKEIsIE4sIERFU0NFTkRJTkcpOwoKICAgIC8vIFMg6rCS7J2EIOqzhOyCsAogICAgaW50IFMgPSAwOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBOOyBpKyspIHsKICAgICAgICBTICs9IEFbaV0gKiBCW2ldOwogICAgfQoKICAgIHByaW50ZigiJWRcbiIsIFMpOwoKICAgIHJldHVybiAwOwp9Cg==