题解
按照b降序排序 每次尽量去涂喜欢程度最高的 能用当前颜色涂的数量就是min(n(剩余需要涂的数量), a[i])
每次用涂色数量*喜欢程度求和就是答案 注意开long long
AC代码
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
struct node
{
int a, b;
bool operator < (const node &oth) const
{
return b > oth.b;
}
}x[MAXN];
int main()
{
#ifdef LOCAL
freopen("C:/input.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; i++)
scanf("%d", &x[i].a);
for (int i = 1; i <= m; i++)
scanf("%d", &x[i].b);
sort(x + 1, x + m + 1);
ll ans = 0;
for (int i = 1; i <= m; i++)
{
int k = min(n, x[i].a); //上色数量
n -= k;
ans += 1LL * x[i].b * k;
}
cout << ans << endl;
return 0;
}