241862026-02-05 22:05:19lorantbDarabolás (50 pont)cpp17Accepted 50/50129ms11316 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,m; cin >> n >> m;
	vector<vector<int>> nums(0, vector<int>(2));
	long long ans = 0;
	int x = 1;
	int y = 1;
	for(int i = 1; i < n; i++) {
		int a; cin >> a;
		nums.push_back({a,1});
	}
	for(int i = 1; i < m; i++) {
		int a; cin >> a;
		nums.push_back({a,2});
	}
	sort(begin(nums), end(nums));
	reverse(begin(nums) , end(nums));
	for(int i = 0; i < n+m-2; i++) {
		if(nums[i][1] == 1) {
			ans += y*nums[i][0];
			x++;
		}
		else {
			ans += x*nums[i][0];
			y++;
		}
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms500 KiB
2Accepted0/068ms6368 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Accepted1/12ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted1/11ms500 KiB
9Accepted1/11ms316 KiB
10Accepted1/11ms316 KiB
11Accepted1/12ms316 KiB
12Accepted1/12ms316 KiB
13Accepted1/11ms316 KiB
14Accepted1/12ms448 KiB
15Accepted1/12ms492 KiB
16Accepted1/12ms316 KiB
17Accepted1/12ms316 KiB
18Accepted1/12ms316 KiB
19Accepted2/22ms316 KiB
20Accepted2/22ms316 KiB
21Accepted3/36ms880 KiB
22Accepted3/312ms1528 KiB
23Accepted4/432ms3332 KiB
24Accepted4/432ms3300 KiB
25Accepted4/467ms6368 KiB
26Accepted4/465ms6216 KiB
27Accepted4/4129ms11220 KiB
28Accepted4/4128ms11316 KiB