238942026-01-31 15:02:57Pedri26Darabolás (50 pont)cpp17Wrong answer 14/5039ms1212 KiB
#include <bits/stdc++.h>

using namespace std;
int n, m, a[100001], b[100001], h=1, sz=1;


int main() {
	
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<n;i++)cin>>a[i];
    for(int i=1;i<m;i++)cin>>b[i];
    sort(a+1, a+n);
    sort(b+1, b+m);
    int i=n-1, j=m-1;
    int s=0;
    a[0]=INT_MIN;
    b[0]=INT_MIN;
    while(i>0 || j>0)
    {
        if(b[j]>a[i])
        {
            s+=h*b[j];
            sz++;
            j--;
        }
        else 
        {
            s+=sz*a[i];
            h++;
            i--;
        }
    }
    cout<<s;
    
    
    
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base14/50
1Accepted0/01ms316 KiB
2Wrong answer0/021ms720 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/12ms316 KiB
7Accepted1/11ms316 KiB
8Accepted1/11ms316 KiB
9Accepted1/11ms348 KiB
10Accepted1/11ms440 KiB
11Accepted1/11ms316 KiB
12Accepted1/11ms316 KiB
13Accepted1/11ms316 KiB
14Accepted1/11ms316 KiB
15Accepted1/11ms316 KiB
16Accepted1/11ms500 KiB
17Wrong answer0/11ms316 KiB
18Wrong answer0/11ms316 KiB
19Wrong answer0/21ms324 KiB
20Wrong answer0/21ms316 KiB
21Wrong answer0/33ms316 KiB
22Wrong answer0/34ms316 KiB
23Wrong answer0/410ms628 KiB
24Wrong answer0/410ms584 KiB
25Wrong answer0/420ms716 KiB
26Wrong answer0/421ms820 KiB
27Wrong answer0/439ms1148 KiB
28Wrong answer0/437ms1212 KiB