C. Quests

思路分析
经典的贪心,每次取出来b的最大值,从前往后扫一遍不断更新即可

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#define int long long
using namespace std;
int n,t,sum,k;
int a[300005];
int b[300005];
int s[300005];
signed main()
{
    cin>>t;
    while(t--){
        cin>>n>>k;
        sum=0;
        int ans=0;
        int mmax=-1;
        for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]+a[i];
        for(int i=1;i<=n;i++) cin>>b[i];
        for(int i=1;i<=min(k,n);i++)
        {
            mmax=max(mmax,b[i]);
            sum=s[i];
            ans=max(ans,sum+(k-i)*mmax);

        }
        cout<<ans<<endl;
    }
   return 0;
}