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
| #include <bits/stdc++.h>
#define int int64_t
const int kMaxN = 1e5 + 5;
int n, x, y, z, ans;
int a[kMaxN], b[kMaxN], c[kMaxN], pre[kMaxN], suf[kMaxN];
std::vector<std::tuple<int, int, int>> vec;
void getpre() {
std::multiset<int> st;
int sum = 0;
for (int i = 1; i <= n; ++i) {
int val = std::get<2>(vec[i]);
if (st.size() < y) sum += val, st.emplace(val);
else if (*st.begin() < val) sum += val - *st.begin(), st.erase(st.begin()), st.emplace(val);
if (i >= y) pre[i] = sum;
}
}
void getsuf() {
std::multiset<int> st;
int sum = 0;
for (int i = n; i; --i) {
int val = std::get<1>(vec[i]);
if (st.size() < x) sum += val, st.emplace(val);
else if (*st.begin() < val) sum += val - *st.begin(), st.erase(st.begin()), st.emplace(val);
if (i <= n - x + 1) suf[i] = sum;
}
}
void dickdreamer() {
std::cin >> x >> y >> z;
n = x + y + z;
for (int i = 1; i <= n; ++i) {
std::cin >> a[i] >> b[i] >> c[i];
ans += c[i], a[i] -= c[i], b[i] -= c[i];
vec.emplace_back(a[i] - b[i], a[i], b[i]);
}
vec.emplace_back(-2e9, 0, 0);
std::sort(vec.begin(), vec.end());
getpre(), getsuf();
int tmp = -1e18;
for (int i = y; i <= n - x; ++i)
tmp = std::max(tmp, pre[i] + suf[i + 1]);
std::cout << ans + tmp << '\n';
}
int32_t main() {
#ifdef ORZXKR
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
int T = 1;
while (T--) dickdreamer();
std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
return 0;
}
|