Code/CHOCOLA.cpp at master · sushiljacksparrow/Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#include <ext/numeric>
#include <ext/hash_map>
#include <ext/hash_set>
#include <ext/algorithm>

using namespace std;
using namespace __gnu_cxx;

#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define ii pair<int,int>
#define vs vector<string>
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)

#define N 1024

int vm[N], vn[N];

int main()
{
	int test, sm, sn, ans, m, n;
	scanf("%d", &test);
	while(test--)
	{
		scanf("%d %d", &m, &n);
		sm=sn=ans=0;
		for(int i=1;i<m;i++)	scanf("%d", &vm[i]), sm+=vm[i];
		for(int i=1;i<n;i++)	scanf("%d", &vn[i]), sn+=vn[i];

		sort(vm+1, vm+m); sort(vn+1, vn+n);
		m--; n--;
		while(m||n)
		{
			if(vm[m]>vn[n])	ans+=vm[m]+sn, sm-=vm[m--];
			else			ans+=vn[n]+sm, sn-=vn[n--];
		}

		printf("%d\n", ans);
	}

	system("pause");
}