250312026-02-17 14:18:06999Darabolás (50 pont)cpp17Accepted 50/5093ms6188 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

signed main() {
    int n,m;cin>>n>>m;
    vector<int> v(n-1),f(m-1);
    for(int i = 0;i<n-1;i++){
        cin>>v[i];
    }
    for(int i = 0;i<m-1;i++){
        cin>>f[i];
    }
    vector<pair<int,int>> ossz;
    int vv=0,vf=0,cost=0;
    for(int i = 0;i<n+m-2;i++){
        if(i<n-1)ossz.push_back({v[i],0});
        else ossz.push_back({f[i-n+1],1});
    }
    sort(ossz.rbegin(),ossz.rend());
    for(int i = 0;i<ossz.size();i++){
        cost+=ossz[i].first*(1+(ossz[i].second==0?vf+(++vv)*0LL:vv+(++vf)*0LL));
    }cout<<cost<<endl;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms512 KiB
2Accepted0/050ms3240 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/12ms316 KiB
7Accepted1/11ms316 KiB
8Accepted1/11ms316 KiB
9Accepted1/11ms316 KiB
10Accepted1/11ms508 KiB
11Accepted1/11ms316 KiB
12Accepted1/11ms332 KiB
13Accepted1/11ms316 KiB
14Accepted1/11ms316 KiB
15Accepted1/12ms508 KiB
16Accepted1/12ms508 KiB
17Accepted1/12ms316 KiB
18Accepted1/12ms324 KiB
19Accepted2/22ms612 KiB
20Accepted2/22ms316 KiB
21Accepted3/34ms732 KiB
22Accepted3/39ms1208 KiB
23Accepted4/426ms1992 KiB
24Accepted4/426ms1980 KiB
25Accepted4/450ms3432 KiB
26Accepted4/450ms3444 KiB
27Accepted4/493ms6188 KiB
28Accepted4/493ms6184 KiB