999F - Cards and Joy - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 500;
const int K = 10;
int dp[N + 10][(N + 10) * K];
const int MAX = 1e5;


int F[MAX+10], C[MAX+10];

main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	int n, k; cin >> n >> k;
	vector<int> c(n * k + 1);
	for(int i = 1;i <= n * k; i++) cin >> c[i];
	vector<int> f(n+1), points(k+1);
	for(int i = 1;i <= n; i++) cin >> f[i];
	for(int i = 1;i <= k; i++) cin >> points[i];
	for(int i = 1;i <= n * k; i++){
		C[c[i]]++;
	}
	for(int i = 1;i <= n; i++){
		F[f[i]]++;
	}
	
	
	for(int i = 0;i < n; i++){
		for(int j = 0;j <= n * k; j++){
			for(int add = 0; add <= k; add++){
				dp[i+1][j + add] = max(dp[i + 1][j + add], dp[i][j] + points[add]);
			}
		}
	}
	
	int ans = 0;
	for(int i = 1;i <= MAX; i++){
		if(F[i] != 0)
		ans+= dp[F[i]][C[i]];
	}
	cout << ans;
	return 0;
}