49. 쌓기 블록의 최댓값 (2차원 배열 응용) [정렬 & 이분탐색(결정알고리즘) & 투포인트 알고리즘 & 스택]

나의정답.

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;

int main(int argc, char** argv) {
	//freopen("input.txt", "rt", stdin);
	int n, k, sum = 0;

	scanf("%d", &n);
	int* face = new int[n];
	int* side = new int[n];
	int** arr = new int* [n];
	for (int i = 0; i < n; i++)
		arr[i] = new int[n];

	for (int i = 0; i < n; i++)
		scanf("%d", &face[i]);

	for (int i = n - 1; i >= 0; i--)
		scanf("%d", &side[i]);

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			arr[i][j] = 0;

	for (int i = n - 1; i >= 0; i--)
		for (int j = 0; j < n; j++)
			arr[i][j] = face[j];
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) {
			if (arr[j][i] > side[j]) {
				arr[j][i] = side[j];
			}
		}

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			sum += arr[i][j];			

	printf("%d", sum);

	for (int i = 0; i < n; i++)
		delete[] arr[i];
	delete[] arr;
	delete[] side;
	delete[] face;
}