백준 1727 [c++]

#include <iostream> #include <algorithm> int man[1001], girl[1001], dp[1001][1001]; using namespace std; int abs(int a) { if (a >= 0) return a; else return -a; } int min(int a, int b) { if (a > b) return b; else return a; } int main(void) { int n, m; cin >> n >> m; for (int i = 1; i <= n; i++) cin >> man[i]; for (int j = 1; j <= m; j++) cin >> girl[j]; sort(man + 1, man + n + 1); sort(girl + 1, girl + m + 1); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { dp[i][j] = dp[i - 1][j - 1...

원문링크 : 백준 1727 [c++]