solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y;
int s1, s2;
int a[1000];
int ct;
bool cmp(int x, int y) { return x > y; }
int main() {
while (~scanf("%d", &n)) {
ct = s1 = s2 = 0;
memset(a, 0, sizeof a);
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
k = (m >> 1);
for (int j = 1; j <= k; j++) {
scanf("%d", &x);
s1 += x;
}
if (m & 1) {
scanf("%d", &a[ct++]);
}
for (int j = 1; j <= k; j++) {
scanf("%d", &x);
s2 += x;
}
}
sort(a, a + ct, cmp);
for (int i = 0; i < ct; i += 2) {
s1 += a[i];
s2 += a[i + 1];
}
cout << s1 << " " << s2 << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = (-1u) / 2;
const long long int INF2 = (-1ull) / 2;
int a, b, i, d[1011000], j, k, n, m, timer = 0, l, r, x, y;
int c[1011000], cnt = 0, fl = 0, a2, a3 = -1000000, ans = 0;
vector<int> v;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 1; j <= m; j++) {
cin >> a;
if (m % 2 == 0) {
if (j <= m / 2)
x += a;
else
y += a;
} else {
if (j <= m / 2)
x += a;
else if (j > m / 2 + 1)
y += a;
else
v.push_back(a);
}
}
}
sort(v.begin(), v.end());
for (i = 0; i < v.size(); i++) {
a = v[v.size() - 1 - i];
if (i % 2 == 0)
x += a;
else
y += a;
}
cout << x << " " << y << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
long long suma1;
long long suma2;
int x;
long long k;
vector<long long> sredine;
long long sumasredine;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cin >> n;
suma1 = 0;
suma2 = 0;
sumasredine = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x % 2 == 0) {
for (int i = 1; i <= x / 2; i++) {
cin >> k;
suma1 += k;
}
for (int i = 1; i <= x / 2; i++) {
cin >> k;
suma2 += k;
}
} else {
for (int i = 1; i <= x / 2; i++) {
cin >> k;
suma1 += k;
}
cin >> k;
sredine.push_back(k);
sumasredine += k;
for (int i = 1; i <= x / 2; i++) {
cin >> k;
suma2 += k;
}
}
}
sort(sredine.begin(), sredine.end());
long long s = 0;
for (int i = sredine.size() - 1; i >= 0; i = i - 2) {
s += sredine[i];
}
cout << suma1 + s << " " << suma2 + (sumasredine - s);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int uno = 0, dos = 0, ctos, son, preg, A[105], num, hay = 0;
int main() {
scanf("%d", &ctos);
for (int i = 1; i <= ctos; i++) {
scanf("%d", &son);
if (son % 2 == 0) {
for (int e = 1; e <= son / 2; e++) {
scanf("%d", &num);
uno += num;
}
for (int e = 1; e <= son / 2; e++) {
scanf("%d", &num);
dos += num;
}
} else {
for (int e = 1; e <= son / 2; e++) {
scanf("%d", &num);
uno += num;
}
++hay;
scanf("%d", &A[hay]);
for (int e = 1; e <= son / 2; e++) {
scanf("%d", &num);
dos += num;
}
}
}
sort(A + 1, A + hay + 1);
for (int i = 1; i <= hay; i++) {
if (i % 2 == 1)
uno += A[hay - i + 1];
else
dos += A[hay - i + 1];
}
printf("%d %d\n", uno, dos);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
signed main() {
ios_base::sync_with_stdio(false), cin.tie(0);
int n, A = 0, B = 0;
cin >> n;
vector<int> odd;
while (n--) {
int c;
cin >> c;
for (int i = (int)1; i <= (int)c; i++) {
int a;
cin >> a;
B += a;
if (i <= c / 2) A += a;
if (c & 1 && i == c / 2 + 1) odd.push_back(a);
}
}
sort(odd.begin(), odd.end(), greater<int>());
for (int i = (int)0; i <= (int)odd.size() - 1; i++) {
if (i % 2 == 0) A += odd[i];
}
cout << A << ' ' << B - A << '\n';
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<pair<int, vector<int> > > x;
int res1 = 0, res2 = 0;
for (int i = 0; i < (n); ++i) {
int db;
scanf("%d", &db);
vector<int> tmp(db);
for (int j = 0; j < (db); ++j) {
scanf("%d", &tmp[j]);
}
if (tmp.size() & 1) {
x.push_back(make_pair(tmp[tmp.size() / 2], tmp));
} else {
for (int j = 0; j < (db); ++j) {
if (j < db / 2)
res1 += tmp[j];
else
res2 += tmp[j];
}
}
}
sort(x.begin(), x.end());
int b = 0;
for (int i = x.size() - 1; i > -1; --i) {
const vector<int>& tmp = x[i].second;
for (int j = 0; j < (tmp.size()); ++j) {
if (j < tmp.size() / 2)
res1 += tmp[j];
else if (j > tmp.size() / 2)
res2 += tmp[j];
}
if (b) {
res2 += tmp[tmp.size() / 2];
} else {
res1 += tmp[tmp.size() / 2];
}
b = 1 - b;
}
printf("%d %d\n", res1, res2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
int main() {
int n;
cin >> n;
int a[111][111] = {0};
int ans1 = 0, ans2 = 0;
vector<int> mids;
for (int i = 1; i <= n; i++) {
cin >> a[i][0];
for (int j = 1; j <= a[i][0]; j++) {
cin >> a[i][j];
if (a[i][0] % 2 == 0) {
if (j <= a[i][0] / 2) {
ans1 += a[i][j];
} else
ans2 += a[i][j];
} else {
if (j < a[i][0] / 2 + 1) {
ans1 += a[i][j];
} else if (j == a[i][0] / 2 + 1 || a[i][0] == 1) {
mids.push_back(a[i][j]);
} else
ans2 += a[i][j];
}
}
}
sort(mids.begin(), mids.end());
reverse(mids.begin(), mids.end());
for (int i = 0; i < mids.size(); i++) {
if (i % 2 == 0) {
ans1 += mids[i];
} else
ans2 += mids[i];
}
cout << ans1 << " " << ans2;
return 0;
}
| 9 | CPP |
from functools import reduce
n = int(input())
cards = [list(map(int, input().split()[1:])) for i in range(n)]
mid = [c[len(c) >> 1] for c in cards if len(c) & 1 == 1]
a, b = 0, 0
add = lambda x=0, y=0: x + y
for c in cards:
m = len(c) >> 1
a += reduce(add, c[:m] or [0])
b += reduce(add, c[m + (len(c) & 1):] or [0])
mid.sort(reverse=True)
a += reduce(add, mid[::2] or [0])
b += reduce(add, mid[1::2] or [0])
print(a, b)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int s0, s1, n, m, kg[1111], a[1111][1111], t, nom, l[1111], r[1111];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &kg[i]);
for (int j = 0; j < kg[i]; j++) scanf("%d", &a[i][j]);
m += kg[i];
}
for (int i = 0; i < n; i++) {
l[i] = 0;
r[i] = kg[i] - 1;
}
s0 = 0;
s1 = 0;
t = 1;
for (int i = 0; i < m; i++) {
t ^= 1;
int maxt = -1000000000;
for (int j = 0; j < n; j++) {
if (l[j] > r[j]) continue;
int ll = l[j], rr = r[j];
int st = 0;
if ((r[j] - l[j] + 1) % 2 == 1) st = (a[j][(l[j] + r[j]) / 2]);
if (st > maxt) {
maxt = st;
nom = j;
}
}
if (t == 0) {
s0 += a[nom][l[nom]];
l[nom]++;
} else {
s1 += a[nom][r[nom]];
r[nom]--;
}
}
cout << s0 << " " << s1 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int s1, s2, curr, a[100];
int main() {
int n, x, y;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
for (int j = 0; j < x / 2; j++) scanf("%d", &y), s1 += y;
if (x & 1) scanf("%d", &a[curr++]);
for (int j = 0; j < x / 2; j++) scanf("%d", &y), s2 += y;
}
sort(a, a + curr, greater<int>());
for (int i = 0; i < curr; i++)
if (i & 1)
s2 += a[i];
else
s1 += a[i];
printf("%d %d\n", s1, s2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wwrite-strings"
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &A) {
out << A.first << "_" << A.second;
return out;
}
template <template <typename, typename> class ContainerT, typename ValueT>
ostream &operator<<(ostream &out,
const ContainerT<ValueT, std::allocator<ValueT> > &A) {
for (__typeof((A).begin()) i = (A).begin(); i != (A).end(); ++i)
out << *i << " ";
return out;
}
template <template <typename, typename> class ContainerT, typename ValueT,
typename ValueU>
ostream &operator<<(
ostream &out, const ContainerT<pair<ValueT, ValueU>,
std::allocator<pair<ValueT, ValueU> > > &A) {
for (__typeof((A).begin()) i = (A).begin(); i != (A).end(); ++i)
out << *i << " ";
return out;
}
template <class T>
void mini(T &a, const T &b) {
if (b < a) a = b;
}
template <class T>
void maxi(T &a, const T &b) {
if (b > a) a = b;
}
int N;
deque<int> sum;
long long solve() {
cin >> N;
sum.clear();
vector<vector<int> > A(N);
vector<vector<int> > AS(N);
sum.push_back(0);
for (int i = 0; i < (N); ++i) {
int s;
cin >> s;
sum.push_back(sum.back() + s);
A[i] = vector<int>(s);
for (int j = 0; j < (s); ++j) cin >> A[i][j];
AS[i] = vector<int>(1);
for (int j = 0; j < (s); ++j) AS[i].push_back(AS[i].back() + A[i][j]);
}
sum.pop_front();
int SSS = 0;
for (int i = 0; i < (N); ++i)
for (__typeof((A[i]).begin()) j = (A[i]).begin(); j != (A[i]).end(); ++j)
SSS += *j;
long long ans = 0;
vector<int> div;
for (int i = 0; i < (N); ++i)
if (A[i].size() % 2 == 0)
ans += AS[i][A[i].size() / 2];
else {
ans += AS[i][A[i].size() / 2];
div.push_back(A[i][A[i].size() / 2]);
}
sort((div).begin(), (div).end(), greater<int>());
for (int i = 0; i < (div.size()); ++i)
if (i % 2 == 0) ans += div[i];
cout << ans << " " << SSS - ans << endl;
return 0;
}
long long solve_() {
cin >> N;
sum.clear();
vector<vector<int> > A(N);
vector<vector<int> > AS(N);
sum.push_back(0);
for (int i = 0; i < (N); ++i) {
int s;
cin >> s;
sum.push_back(sum.back() + s);
A[i] = vector<int>(s);
for (int j = 0; j < (s); ++j) cin >> A[i][j];
AS[i] = vector<int>(1);
for (int j = 0; j < (s); ++j) AS[i].push_back(AS[i].back() + A[i][j]);
}
sum.pop_front();
int SSS = 0;
for (int i = 0; i < (N); ++i)
for (__typeof((A[i]).begin()) j = (A[i]).begin(); j != (A[i]).end(); ++j)
SSS += *j;
int curS = 0;
int S = sum.back();
vector<int> D(S + 1, -1);
D[0] = 0;
for (int i = 0; i < (N); ++i) {
curS += sum[i];
vector<int> newD(D);
for (int j = 0; j < (S + 1); ++j) {
if (D[j] == -1) break;
for (int k = (j + 1); k <= (min(j + sum[i], S)); ++k) {
if (k > (curS + 1) / 2) break;
if (k < (curS - 1) / 2) continue;
if (k - j > (A[i].size() + 1) / 2) break;
maxi(newD[k], D[j] + AS[i][k - j]);
}
}
D = newD;
cout << "D"
<< ": " << D << endl;
}
int max = D[(S + 1) / 2];
cout << max << " " << SSS - max << endl;
return 0;
}
int main() {
solve();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
int n, sz[111], a[111], sum1, sum2;
vector<int> vec;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &sz[i]);
for (int j = 1; j <= sz[i]; j++) scanf("%d", &a[j]);
if (sz[i] % 2 == 1) {
vec.push_back(a[sz[i] / 2 + 1]);
}
for (int j = 1; j <= sz[i] / 2; j++) sum1 += a[j];
int st;
if (sz[i] % 2 == 0)
st = sz[i] / 2 + 1;
else
st = sz[i] / 2 + 2;
for (int j = st; j <= sz[i]; j++) sum2 += a[j];
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); i++) {
if (i % 2 == 0)
sum1 += vec[i];
else
sum2 += vec[i];
}
printf("%d %d\n", sum1, sum2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int A[110];
int n, m, s1, s2;
void enter() {
cin >> n;
for (int i = 1; i <= n; ++i) {
int ni;
cin >> ni;
for (int j = 1; j <= ni; ++j) {
int a;
cin >> a;
if (j * 2 - 1 == ni)
A[++m] = a;
else
(j * 2 <= ni ? s1 : s2) += a;
}
}
}
void solve() {
sort(A + 1, A + m + 1);
int k = 0;
for (int i = m; i > 0; --i) {
k ^= 1;
(k ? s1 : s2) += A[i];
}
cout << s1 << " " << s2;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
if (ifstream("388C.inp")) cin.rdbuf((new ifstream("388C.inp"))->rdbuf());
enter();
solve();
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int inf = 1023456789;
template <typename T>
inline void chkmax(T &a, T b) {
if (a < b) a = b;
}
template <typename T>
inline void chkmin(T &a, T b) {
if (a > b) a = b;
}
template <typename T>
inline T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <typename T>
inline T expmod(T a, T b, T c = mod) {
T rlt = 1;
for (a %= c; b; b >>= 1, a = a * a % c)
if (b & 1) rlt = rlt * a % c;
return rlt;
}
int n, cnt[111], m, a[111], sa, sb;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &cnt[i]);
for (int j = 1, k; j <= cnt[i]; j++) {
scanf("%d", &k);
if (cnt[i] & 1) {
if (j <= cnt[i] / 2)
sa += k;
else if (j == cnt[i] / 2 + 1)
a[++m] = k;
else
sb += k;
} else {
if (j <= cnt[i] / 2)
sa += k;
else
sb += k;
}
}
}
sort(a + 1, a + m + 1);
reverse(a + 1, a + m + 1);
for (int i = 1; i <= m; i++) {
if (i & 1)
sa += a[i];
else
sb += a[i];
}
printf("%d %d\n", sa, sb);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int s[N], a[N][N], n, ciel[N], jiro[N], cur[N], _ciel[N], _jiro[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
cur[i] = s[i];
_jiro[i] = s[i] - 1;
if (s[i] % 2) {
ciel[i] = s[i] / 2 - 1;
jiro[i] = s[i] / 2 + 1;
} else {
ciel[i] = s[i] / 2 - 1;
jiro[i] = s[i] / 2;
}
for (int j = 0; j < s[i]; j++) {
cin >> a[i][j];
}
}
bool ciel_move = 0;
int ciel_score = 0, jiro_score = 0;
for (int _n = n; _n;) {
ciel_move = !ciel_move;
if (ciel_move) {
int index, best_add = -int(1e9);
for (int i = 0; i < n; i++) {
if (!cur[i]) continue;
int add;
if (cur[i] % 2) {
add = a[i][ciel[i] + 1];
} else {
add = 0;
}
if (add > best_add) {
best_add = add;
index = i;
}
}
if (cur[index] % 2) {
ciel[index]++;
} else {
jiro[index]++;
}
ciel_score += a[index][_ciel[index]++];
cur[index]--;
if (!cur[index]) _n--;
} else {
int index, best_add = -int(1e9);
for (int i = 0; i < n; i++) {
if (!cur[i]) continue;
int add;
if (cur[i] % 2) {
add = a[i][jiro[i] - 1];
} else {
add = 0;
}
if (add > best_add) {
best_add = add;
index = i;
}
}
if (cur[index] % 2) {
jiro[index]--;
} else {
ciel[index]--;
}
jiro_score += a[index][_jiro[index]--];
cur[index]--;
if (!cur[index]) _n--;
}
}
cout << ciel_score << " " << jiro_score << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
void insercion(int *impares, int tamanio);
int main() {
int n, tamanio = 0, i, j, a, b, c, d, ciel = 0, jiro = 0;
scanf("%d", &n);
int impares[100];
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a == 1) {
scanf("%d", &d);
impares[tamanio] = d;
tamanio++;
} else {
for (j = 1; j <= a / 2; j++) {
scanf("%d", &b);
ciel += b;
}
if (a % 2 != 0 && a > 1) {
scanf("%d", &d);
impares[tamanio] = d;
tamanio++;
j++;
}
for (; j <= a; j++) {
scanf("%d", &c);
jiro += c;
}
}
}
if (tamanio > 0) {
insercion(impares, tamanio);
for (i = 0; i < tamanio; i++) {
if (i % 2 == 0)
ciel += impares[i];
else
jiro += impares[i];
}
}
printf("%d %d", ciel, jiro);
return 0;
}
void insercion(int *impares, int tamanio) {
int i, k, j;
for (i = 1; i < tamanio; i++) {
k = impares[i];
j = i - 1;
while (j >= 0 && impares[j] < k) {
impares[j + 1] = impares[j];
j = j - 1;
}
impares[j + 1] = k;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long infl = 1e18 + 5;
long long int n, q, x, y, mx = -1, mn = infl, f, val, sz, cnt, ans, t = 1, i, j,
ind = -1, sm;
long long int b[1000004];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (fopen("inp.txt", "r")) {
freopen("myfile.txt", "w", stdout);
freopen("inp.txt", "r", stdin);
}
cin >> n;
long long int s1 = 0, s2 = 0;
std::vector<long long int> v;
for (i = 0; i < n; i++) {
cin >> b[i];
cnt = 0;
t = -1, sm = 0;
for (j = 0; j < b[i]; j++) {
cin >> x;
if (b[i] % 2 == 1 && cnt == b[i] / 2) t = x;
cnt++;
if (cnt <= (b[i]) / 2) sm += x;
s2 += x;
}
if (t != -1) {
v.push_back(t);
s2 -= t;
}
s2 -= sm;
s1 += sm;
}
sort(v.begin(), v.end(), greater<long long int>());
for (i = 0; i < (long long int)v.size(); i++) {
s1 += v[i];
++i;
if (i < (long long int)v.size()) s2 += v[i];
}
cout << s1 << " " << s2;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> elements;
int main() {
long long int n, first = 0, second = 0;
cin >> n;
while (n--) {
long long int m;
cin >> m;
for (int i = 1; i <= m / 2; i++) {
long long int a;
cin >> a;
first += a;
}
if (m & 1) {
long long int a;
cin >> a;
elements.push_back(a);
}
for (int i = 1; i <= m / 2; i++) {
long long int a;
cin >> a;
second += a;
}
}
sort(elements.begin(), elements.end());
long long int turn = 1;
for (int i = (long long int)elements.size() - 1; i >= 0; i--) {
if (turn)
first += elements[i];
else
second += elements[i];
turn = turn ^ 1;
}
cout << first << " " << second << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double EPS = -1e8;
const double Pi = acos(-1);
bool inline equ(double a, double b) { return fabs(a - b) < EPS; }
const int MAXN = 110;
int n;
vector<int> v;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
int ans[2] = {0, 0};
for (int i = (1); i <= (n); i++) {
int sz;
cin >> sz;
for (int j = (1); j <= (sz); j++) {
int c;
cin >> c;
if (j <= sz / 2)
ans[0] += c;
else if (j > (sz + 1) / 2)
ans[1] += c;
else
v.push_back(c);
}
}
sort((v).begin(), (v).end());
reverse((v).begin(), (v).end());
for (int i = (0); i <= ((int)(v).size() - 1); i++) ans[i & 1] += v[i];
cout << ans[0] << ' ' << ans[1] << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int Lpow(long long int a, long long int b) {
long long int ans = 1;
while (b > 0) {
if (b % 2) ans = (ans * a);
a = (a * a);
b = b / 2;
}
return ans;
}
long long int Lpow(long long int a, long long int b, long long int M) {
long long int ans = 1;
while (b > 0) {
if (b % 2) ans = (ans * a) % M;
a = (a * a) % M;
b = b / 2;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
vector<int> brr;
int f1 = 0;
int f2 = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
int sum = 0;
int y;
int sum2 = 0;
for (int j = 0; j < x; j++) {
cin >> y;
if (j > ((x - 1) / 2)) sum += y;
if (j < (x / 2)) sum2 += y;
if (x % 2 == 1 && j == x / 2) brr.push_back(y);
}
f1 += sum2;
f2 += sum;
}
sort(brr.begin(), brr.end());
reverse(brr.begin(), brr.end());
for (int i = 0; i < brr.size(); i += 2) f1 += brr[i];
for (int i = 1; i < brr.size(); i -= -2) f2 += brr[i];
cout << f1 << " " << f2 << '\n';
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 101;
int ans1, ans2, n;
int num;
int a[maxn];
bool cmp(int a, int b) { return a > b; }
void read(int &x) {
char ch;
x = 0;
while (!isdigit(ch = getchar()))
;
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
}
void init() {
read(n);
int x;
for (int i = 1; i <= n; ++i) {
read(num);
for (int j = 1; j <= num; ++j) {
read(x);
if ((num & 1) && j == num / 2 + 1) {
a[i] = x;
continue;
}
if (j <= num / 2)
ans1 += x;
else
ans2 += x;
}
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; ++i)
if (i & 1)
ans1 += a[i];
else
ans2 += a[i];
printf("%d %d\n", ans1, ans2);
}
int main() {
init();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const long long inf = 1e+9;
const long long inf64 = inf * inf;
template <typename T>
istream &operator>>(istream &, vector<T> &);
template <typename T>
ostream &operator<<(ostream &, const vector<T> &);
int num = 4;
vector<vector<char> > g(1005, vector<char>(1005));
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> sum(2);
vector<int> tmp;
for (int i = 0; i < n; i++) {
int q;
cin >> q;
if (q % 2 == 0) {
int x;
for (int j = 0; j < 2; j++) {
for (int k = 0; k < q / 2; k++) {
cin >> x;
sum[j] += x;
}
}
} else {
int x;
for (int k = 0; k < q / 2; k++) {
cin >> x;
sum[0] += x;
}
cin >> x;
tmp.push_back(x);
for (int k = 0; k < q / 2; k++) {
cin >> x;
sum[1] += x;
}
}
}
sort(tmp.rbegin(), tmp.rend());
for (int i = 0; i < tmp.size(); i++) {
sum[i % 2] += tmp[i];
}
cout << sum[0] << " " << sum[1] << endl;
return 0;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (int i = 0; i < v.size(); ++i) is >> v[i];
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i) os << v[i] << " ";
return os;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T Abs(T first) {
return (first < 0 ? -first : first);
}
template <typename T>
T Sqr(T first) {
return (first * first);
}
string plural(string s) {
return (int((s).size()) && s[int((s).size()) - 1] == 'x' ? s + "en"
: s + "s");
}
const int INF = (int)1e9;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
bool Read(int &first) {
char c, r = 0, n = 0;
first = 0;
for (;;) {
c = getchar();
if ((c < 0) && (!r)) return (0);
if ((c == '-') && (!r))
n = 1;
else if ((c >= '0') && (c <= '9'))
first = first * 10 + c - '0', r = 1;
else if (r)
break;
}
if (n) first = -first;
return (1);
}
int main() {
if (0) freopen("in.txt", "r", stdin);
int N;
int i, j, v, mi, mv;
int ans1 = 0, ans2 = 0;
int M[100], L[100], R[100];
static int V[100][100];
Read(N);
for (i = 0; i < N; i++) {
Read(M[i]);
L[i] = 0;
R[i] = M[i] - 1;
for (j = 0; j < M[i]; j++) Read(V[i][j]);
}
for (;;) {
mv = -1;
for (i = 0; i < N; i++)
if (L[i] <= R[i]) {
if ((R[i] - L[i] + 1) % 2 == 0)
v = 0;
else
v = V[i][(L[i] + R[i]) / 2];
if (v > mv) mv = v, mi = i;
}
if (mv < 0) break;
ans1 += V[mi][L[mi]++];
mv = -1;
for (i = 0; i < N; i++)
if (L[i] <= R[i]) {
if ((R[i] - L[i] + 1) % 2 == 0)
v = 0;
else
v = V[i][(L[i] + R[i]) / 2];
if (v > mv) mv = v, mi = i;
}
if (mv < 0) break;
ans2 += V[mi][R[mi]--];
}
printf("%d %d\n", ans1, ans2);
return (0);
}
| 9 | CPP |
n = int(input())
a = b = 0
s = []
for _ in range(n):
l = [*map(int, input().split())][1:]
m = len(l)
if m & 1:
s.append(l[m//2])
a += sum((l[:m//2]))
b += sum((l[(m + 1)//2:]))
s.sort(reverse = True)
a += sum(s[::2])
b += sum(s[1::2])
print(a, b) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int Gain(deque<int>& dq) {
if (dq.empty()) {
return -1;
}
int size = dq.size();
if (size % 2 == 1) {
return dq[size / 2];
}
return 0;
}
int main() {
scanf("%d", &n);
vector<deque<int>> nums(n);
int remain = 0;
for (int i = 0; i < n; ++i) {
int size = 0;
scanf("%d", &size);
int val = 0;
for (int j = 0; j < size; ++j) {
scanf("%d", &val);
nums[i].emplace_back(val);
remain += val;
}
}
int ciel = 0, jiro = 0;
int turn = 0;
while (true) {
int max_profit = -1;
int max_id = -1;
for (int i = 0; i < n; ++i) {
int curr = Gain(nums[i]);
if (curr > max_profit) {
max_profit = curr;
max_id = i;
}
}
if (max_profit < 0) {
break;
}
if (turn % 2 == 0) {
ciel += nums[max_id].front();
nums[max_id].pop_front();
} else {
jiro += nums[max_id].back();
nums[max_id].pop_back();
}
++turn;
}
printf("%d %d\n", ciel, jiro);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
x = 0;
int fu = 1;
char c = getchar();
while (c > 57 || c < 48) {
if (c == 45) fu = -1;
c = getchar();
}
while (c <= 57 && c >= 48) {
x = (x << 3) + (x << 1) + c - 48;
c = getchar();
}
x *= fu;
}
template <typename T>
inline void fprint(T x) {
if (x < 0) putchar(45), x = -x;
if (x > 9) fprint(x / 10);
putchar(x % 10 + 48);
}
template <typename T>
inline void fprint(T x, char ch) {
fprint(x);
putchar(ch);
}
int n, ans1, ans2;
vector<int> vec;
int main() {
read(n);
while (n--) {
int k;
read(k);
for (register int i = 1; i <= k; i++) {
int x;
read(x);
if (i <= (k >> 1))
ans1 += x;
else if ((k & 1) && i == ((k + 1) >> 1))
vec.push_back(x);
else
ans2 += x;
}
}
sort(vec.begin(), vec.end());
int it = 1;
while (!vec.empty()) {
if (it)
ans1 += vec.back();
else
ans2 += vec.back();
vec.pop_back();
it ^= 1;
}
fprint(ans1, 32);
fprint(ans2, 10);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[110], f[110], l, r, x, y, ans, m;
bool cmp(int x, int y) { return x > y; }
int main() {
int n;
while (scanf("%d", &n) != EOF) {
ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1; j <= m; j++) scanf("%d", &a[j]);
int l = 0, r = m + 1;
while (1) {
l++;
r--;
if (l >= r)
break;
else {
x += a[l];
y += a[r];
}
}
if (l == r) f[ans++] = a[l];
}
sort(f, f + ans, cmp);
for (int i = 0; i < ans; i++)
if (i % 2 == 0)
x += f[i];
else
y += f[i];
printf("%d %d\n", x, y);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> mq[105];
int xf[105];
int main() {
int n, s, x;
int i, j;
int a, b;
while (cin >> n) {
for (i = 1; i <= 100; i++) mq[i].clear();
a = 0, b = 0;
for (i = 1; i <= n; i++) {
cin >> s;
while (s--) {
cin >> x;
mq[i].push_back(x);
}
}
int t = 0;
for (i = 1; i <= n; i++) {
if (!(mq[i].size() & 1)) {
for (j = 0; j < mq[i].size() / 2; j++) a += mq[i][j];
for (; j < mq[i].size(); j++) b += mq[i][j];
} else {
for (j = 0; j < mq[i].size() / 2; j++) a += mq[i][j];
xf[t++] = mq[i][j++];
for (; j < mq[i].size(); j++) b += mq[i][j];
}
}
sort(xf, xf + t);
int flag = 0;
for (i = t - 1; i >= 0; i--) {
if (!flag) {
a += xf[i];
flag = 1;
} else {
b += xf[i];
flag = 0;
}
}
cout << a << " " << b << endl;
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N], s[N], o1, o2, top, n;
inline void fr(int &num) {
num = 0;
char c = getchar();
int p = 1;
while (c < '0' || c > '9') c == '-' ? p = -1, c = getchar() : c = getchar();
while (c >= '0' && c <= '9') num = num * 10 + c - '0', c = getchar();
num *= p;
}
inline bool cmp(register int x, register int y) { return x > y; }
int main() {
fr(n);
for (register int i = 1; i <= n; ++i) {
fr(a[0]);
for (register int j = 1; j <= a[0]; ++j) fr(a[j]);
if (a[0] & 1) s[++top] = a[a[0] / 2 + 1], a[a[0] / 2 + 1] = 0;
for (register int j = 1, sz = a[0] >> 1; j <= sz; ++j) o1 += a[j];
for (register int j = (a[0] >> 1) + 1; j <= a[0]; ++j) o2 += a[j];
}
sort(s + 1, s + 1 + top, cmp);
for (register int i = 1; i <= top; ++i) i & 1 ? o1 += s[i] : o2 += s[i];
printf("%d %d", o1, o2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
const long long int inf = 10000000000000000LL;
const long long int mod = 1000000007;
int main() {
srand(13);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(2);
int start = clock();
int n;
cin >> n;
long long int a = 0, b = 0;
vector<long long int> arr;
for (int i = 0; i < (n); ++i) {
int s;
cin >> s;
vector<long long int> c(s);
for (int i = 0; i < (s); ++i) {
cin >> c[i];
}
for (int i = 0; i < (s / 2); ++i) {
a += c[i];
b += c[s - 1 - i];
}
if (s % 2) {
arr.push_back(c[s / 2]);
}
}
sort(arr.begin(), arr.end(), greater<long long int>());
for (int i = 0; i < (arr.size()); ++i) {
if (i % 2 == 0) {
a += arr[i];
} else {
b += arr[i];
}
}
cout << a << " " << b;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, a = 0, b = 0, x;
vector<long long> v;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &m);
for (int j = 0; j < m / 2; j++) {
scanf("%lld", &x);
a += x;
}
if (m % 2 == 1) {
scanf("%lld", &x);
v.push_back(x);
}
for (int j = 0; j < m / 2; j++) {
scanf("%lld", &x);
b += x;
}
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i % 2 == 0)
a += v[v.size() - i - 1];
else
b += v[v.size() - i - 1];
}
cout << a << " " << b << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 111;
vector<int> cards[SIZE], sp;
int main() {
int an1 = 0, an2 = 0;
int(n);
scanf("%d", &n);
for (int i = 0; i < (n); ++i) {
int(m);
scanf("%d", &m);
for (int j = 0; j < (m); ++j) {
int(x);
scanf("%d", &x);
cards[i].push_back(x);
}
if (m % 2 == 0) {
for (int j = 0; j < (m / 2); ++j) {
an1 += cards[i][j];
an2 += cards[i][j + m / 2];
}
} else {
for (int j = 0; j < (m / 2); ++j) {
an1 += cards[i][j];
an2 += cards[i][j + m / 2 + 1];
}
sp.push_back(cards[i][m / 2]);
}
}
sort((sp).begin(), (sp).end());
reverse((sp).begin(), (sp).end());
for (int i = 0; i < (((int)(sp).size())); ++i) {
if (i % 2 == 0)
an1 += sp[i];
else
an2 += sp[i];
}
printf("%d %d\n", an1, an2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
const int maxm = 3e5 + 10;
const long long mod = 1e9 + 7;
const int inf = (int)1e9 + 50;
const double eps = 1e-5;
const double pi = acos(-1.0);
int n;
int a[maxn];
vector<int> res;
int p, q;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
if (t & 1) {
for (int j = 1; j <= t; j++) {
cin >> a[j];
if (j == (t + 1) / 2)
res.push_back(a[j]);
else if (j < (t + 1) / 2)
p += a[j];
else
q += a[j];
}
} else {
for (int j = 0; j < t; j++) {
cin >> a[j];
if (j < (t + 1) / 2)
p += a[j];
else
q += a[j];
}
}
}
sort(res.begin(), res.end(), greater<int>());
for (int i = 0; i < res.size(); i++) {
if (i & 1)
q += res[i];
else
p += res[i];
}
cout << p << " " << q;
return ~~(0 - 0);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long LLINF = 1LL << 61;
const int INF = 1e9;
const double EPS = 1e-9;
const int N = 111;
int n, cnt[N], pile[N][N];
int main() {
cin >> n;
int sum = 0, best = 0;
vector<int> mid;
for (int i = (int)(1), _b = (int)(n); i <= _b; ++i) {
cin >> cnt[i];
for (int j = (int)(1), _b = (int)(cnt[i]); j <= _b; ++j) {
cin >> pile[i][j];
sum += pile[i][j];
}
for (int j = (int)(1), _b = (int)(cnt[i] / 2); j <= _b; ++j)
best += pile[i][j];
if (cnt[i] % 2 == 1) mid.push_back(pile[i][cnt[i] / 2 + 1]);
}
sort(mid.rbegin(), mid.rend());
for (int i = 0; i < mid.size(); i += 2) best += mid[i];
printf("%d %d\n", best, sum - best);
return 0;
}
| 9 | CPP |
n = int(input())
S = [0] * n
ciel, giro = 0, 0
odd = []
for i in range(n):
L = list(map(int, input().split()))
k = L[0]
L = L[1:]
S[i] = sum(L)
if k % 2:
odd.append(L[k // 2])
ciel += sum(L[:k // 2])
giro += sum(L[(k + 1) // 2:])
odd.sort(reverse=True)
for i, x in enumerate(odd):
if i % 2:
giro += x
else:
ciel += x
print(ciel, giro)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
const long long int mod = 9999999999999983;
long long int primes[6] = {1125899906842597, 1495921043, 1005985879,
1495921043, 1005985879, 1495921043};
using namespace std;
vector<long long int> adj[2000009];
long long int parent[2000009];
long long int vis[2000009];
long long int level[2000009];
long long int dist[2000009];
long long int dp[100009];
long long int arr[100009];
long long int brr[2000009];
long long int crr[2000009];
long long int hashing[2000009];
long long int ar[509][509];
long long int br[509][509];
long long int cr[509][509];
long long int multiply(long long int a, long long int b) {
return ((a % mod) * (b % mod)) % mod;
}
long long int add(long long int a, long long int b) {
return ((a % mod) + (b % mod)) % mod;
}
long long int sub(long long int a, long long int b) {
return ((a % mod) - (b % mod) + mod) % mod;
}
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = ((res % p) * (x % p)) % p;
y = y >> 1;
x = ((x % p) * (x % p)) % p;
}
return res;
}
int main() {
int start_s = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<long long int> vect, vt, vct;
vector<long long int>::iterator itt;
set<long long int> st;
set<long long int>::iterator itr;
map<long long int, long long int> mp, mpp, mp1, mp2;
map<long long int, long long int>::iterator it;
long long int i, j, k, n, m, res1, res2, q, t, a, b, c,
maxi = INT_MIN, mini = INT_MAX, sum = 0, ans = 0, res = 0, val = 0,
ans1 = 0, ans2 = 0, rem = 0, diff = 0, cnt = 0, l, r, flag = 0, e, index,
val1 = 0, val2 = 0, z, h = 0, u, v, mid, len, tot, fl = 0;
string str, str1, str2;
cin >> n;
long long int arr[n + 1][3000];
long long int sz[n + 1];
for (i = 1; i <= n; i++) {
cin >> sz[i];
for (j = 1; j <= sz[i]; j++) {
cin >> e;
arr[i][j] = e;
}
}
ans = 0, res = 0;
for (i = 1; i <= n; i++) {
for (j = 1, k = sz[i]; j <= sz[i] / 2; j++, k--) {
ans += arr[i][j];
res += arr[i][k];
}
if (sz[i] % 2 == 1) {
vect.push_back(arr[i][(sz[i] + 1) / 2]);
}
}
sort(vect.rbegin(), vect.rend());
for (i = 0; i < vect.size(); i++) {
if (i % 2 == 0)
ans += vect[i];
else
res += vect[i];
}
cout << ans << " " << res;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long int INFF = 1e17;
const double EPS = 1e-9;
const long long int MOD = 1e9 + 7;
const int MAXN = 1e2 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, sum1 = 0, sum2 = 0, iter = 0;
vector<vector<int> > p(MAXN);
vector<int> s;
cin >> n;
for (int i = (0); i < (n); ++i) {
int t1;
cin >> t1;
p[i].resize(t1);
for (int j = (0); j < (t1); ++j) cin >> p[i][j];
}
for (int i = (0); i < (n); ++i) {
if (!(p[i].size() % 2)) {
for (int j = (0); j < (p[i].size() / 2); ++j) sum1 += p[i][j];
for (int j = (p[i].size() / 2); j < (p[i].size()); ++j) sum2 += p[i][j];
} else {
for (int j = (0); j < (p[i].size() / 2); ++j) sum1 += p[i][j];
for (int j = ((p[i].size() / 2) + 1); j < (p[i].size()); ++j)
sum2 += p[i][j];
s.push_back(p[i][p[i].size() / 2]);
}
}
sort(s.begin(), s.end());
reverse(s.begin(), s.end());
for (auto u : s) {
if (!(iter % 2))
sum1 += u;
else
sum2 += u;
iter++;
}
cout << sum1 << " " << sum2 << '\n';
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[10005], b[10005], c, d, e, f, g, h, i, j, k, l, m, n;
inline bool cmp(const int &a, const int &b) { return a > b; }
int main() {
scanf("%d", &n);
for (l = 1; l <= n; l++) {
scanf("%d", &k);
for (i = 1; i <= k; i++) scanf("%d", &a[i]);
for (i = 1; i <= k / 2; i++) h += a[i];
for (i = (k + 1) / 2 + 1; i <= k; i++) g += a[i];
if (k & 1) b[++m] = a[k / 2 + 1];
}
sort(b + 1, b + 1 + m, cmp);
for (i = 1; i <= m; i++)
if (i & 1)
h += b[i];
else
g += b[i];
printf("%d %d", h, g);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, a[N], s[N], js;
int p, q;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int m;
scanf("%d", &m);
int t = m >> 1;
for (int j = 0; j <= m - 1; ++j) {
scanf("%d", &a[j]);
if (j < t)
p += a[j];
else
q += a[j];
}
if (m & 1) q -= a[t], s[++js] = a[t];
}
sort(s + 1, s + js + 1, greater<int>());
for (int i = 1; i <= js; ++i)
if (i & 1)
p += s[i];
else
q += s[i];
printf("%d %d\n", p, q);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
int n;
int l, c;
int t1, t2;
int i, j;
int ll = 0;
scanf("%d", &n);
t1 = 0;
t2 = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &l);
for (j = 1; j <= l / 2; j++) {
scanf("%d", &c);
t1 = t1 + c;
}
if (l % 2 == 1) {
ll++;
scanf("%d", &a[ll]);
}
for (j = 1; j <= l / 2; j++) {
scanf("%d", &c);
t2 = t2 + c;
}
}
sort(a + 1, a + ll + 1);
for (i = ll; i >= 1; i = i - 2) {
t1 = t1 + a[i];
if (i > 1) t2 = t2 + a[i - 1];
}
printf("%d %d\n", t1, t2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int c[105], a[105][1005];
int main() {
int n, sum1 = 0, sum2 = 0;
cin >> n;
vector<int> p;
for (int i = 1; i <= n; i++) {
cin >> c[i];
for (int j = 1; j <= c[i]; j++) {
cin >> a[i][j];
}
for (int j = 1; j <= c[i] / 2; j++) {
sum1 += a[i][j];
}
for (int j = c[i] - c[i] / 2 + 1; j <= c[i]; j++) {
sum2 += a[i][j];
}
if (c[i] % 2 == 1) p.push_back(a[i][c[i] / 2 + 1]);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
int tag = 0;
for (int i = 0; i < p.size(); i++) {
if (tag == 0)
sum1 += p[i];
else
sum2 += p[i];
tag ^= 1;
}
cout << sum1 << " " << sum2 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int n, mid[MAXN];
int main(int argc, char const *argv[]) {
cin >> n;
int k = 0, sumCiel = 0, sumJiro = 0;
for (int i = 0; i < n; i++) {
int len;
cin >> len;
int temp;
for (int i = 0; i < len; i++) {
cin >> temp;
if (i < len / 2)
sumCiel += temp;
else if (len % 2 && i == len / 2)
mid[k++] = temp;
else
sumJiro += temp;
}
}
sort(mid, mid + k);
for (int i = k - 1; i >= 0; i--) {
if ((k - i) % 2)
sumCiel += mid[i];
else
sumJiro += mid[i];
}
cout << sumCiel << ' ' << sumJiro << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
typedef struct {
int inicio;
int fin;
int mazo[100];
} PilaCartas;
void leerPilas(int totalPilas, PilaCartas PCartas[], int *totalCartas);
void jugar(int totalPilas, PilaCartas PCartas[], int totalCartas);
int main() {
int totalPilas, totalCartas = 0;
scanf("%d", &totalPilas);
PilaCartas PCartas[totalPilas];
leerPilas(totalPilas, PCartas, &totalCartas);
jugar(totalPilas, PCartas, totalCartas);
return 0;
}
void leerPilas(int totalPilas, PilaCartas PCartas[], int *totalCartas) {
int i, PA, j;
for (i = 0; i < totalPilas; i++) {
scanf("%d", &PA);
*totalCartas = *totalCartas + PA;
PCartas[i].inicio = 0;
PCartas[i].fin = PA - 1;
for (j = 0; j < PA; j++) {
scanf("%d", &(PCartas[i].mazo[j]));
}
}
}
void jugar(int totalPilas, PilaCartas PCartas[], int totalCartas) {
long long int ciel, jiro;
int fin;
int i, j, repartir;
int indiceMayorCarta;
ciel = jiro = repartir = 0;
for (i = 0; i < totalPilas; i++) {
fin = PCartas[i].fin + 1;
for (j = 0; j < fin; j++) {
if (j < fin / 2) {
ciel = ciel + PCartas[i].mazo[j];
} else if (j == fin / 2 && (fin % 2) != 0) {
PCartas[i].inicio = j;
PCartas[i].fin = j;
} else {
jiro = jiro + PCartas[i].mazo[j];
}
}
}
indiceMayorCarta = 0;
repartir = 0;
while (indiceMayorCarta != -1) {
indiceMayorCarta = -1;
for (i = 0; i < totalPilas; i++) {
if (indiceMayorCarta != -1) {
if (PCartas[i].inicio == PCartas[i].fin) {
if (PCartas[i].mazo[PCartas[i].inicio] >
PCartas[indiceMayorCarta]
.mazo[PCartas[indiceMayorCarta].inicio]) {
indiceMayorCarta = i;
}
}
} else if (PCartas[i].inicio == PCartas[i].fin) {
indiceMayorCarta = i;
}
}
if (indiceMayorCarta != -1) {
if (repartir % 2 == 0) {
ciel = ciel +
PCartas[indiceMayorCarta].mazo[PCartas[indiceMayorCarta].inicio];
PCartas[indiceMayorCarta].inicio++;
} else {
jiro = jiro +
PCartas[indiceMayorCarta].mazo[PCartas[indiceMayorCarta].inicio];
PCartas[indiceMayorCarta].inicio++;
}
repartir = repartir + 1;
}
}
printf("%I64d %I64d", ciel, jiro);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> vec;
int s1 = 0, s2 = 0;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int br;
cin >> br;
for (int i = 0; i < br / 2; i++) {
int a;
cin >> a;
s1 += a;
}
if (br % 2) {
int a;
cin >> a;
vec.push_back(a);
}
for (int i = 0; i < br / 2; i++) {
int a;
cin >> a;
s2 += a;
}
}
sort(vec.begin(), vec.end());
for (int i = vec.size() - 1; i >= 0; i--)
if ((vec.size() - i) % 2)
s1 += vec[i];
else
s2 += vec[i];
cout << s1 << " " << s2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[100 + 3], g[100 + 3], n, sl, nn, ansx, ansy;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &sl);
for (int j = 1; j <= sl; j++) scanf("%d", &g[j]);
int ll = (sl + 1) >> 1;
for (int j = 1; j < ll; j++) ansx += g[j];
for (int j = sl; j > ll; j--) ansy += g[j];
if (sl & 1)
a[++nn] = g[ll];
else
ansx += g[ll];
}
sort(a + 1, a + nn + 1);
for (int i = nn; i >= 1; i--)
if ((nn - i) & 1)
ansy += a[i];
else
ansx += a[i];
printf("%d %d", ansx, ansy);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
const long double pi = acos(-1);
const int MOD = 1e9 + 7;
int n;
vector<int> sobra;
int main() {
scanf("%d", &n);
int n0 = 0, n1 = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x % 2 == 0) {
for (int i = 0; i < x / 2; i++) {
int y;
scanf("%d", &y);
n0 += y;
}
for (int i = 0; i < x / 2; i++) {
int y;
scanf("%d", &y);
n1 += y;
}
} else {
for (int i = 0; i < x / 2; i++) {
int y;
scanf("%d", &y);
n0 += y;
}
int y;
scanf("%d", &y);
sobra.push_back(y);
for (int i = 0; i < x / 2; i++) {
int y;
scanf("%d", &y);
n1 += y;
}
}
}
bool j1 = true;
sort(sobra.begin(), sobra.end());
while (sobra.size() > 0) {
if (j1) {
n0 += sobra.back();
} else {
n1 += sobra.back();
}
j1 = !j1;
sobra.pop_back();
}
cout << n0 << " " << n1 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
const char en = '\n';
using namespace std;
int main() {
ios::sync_with_stdio(false);
long long a = 0, b = 0, n;
vector<long long> X;
cin >> n;
for (int i = 1; i <= n; i++) {
vector<long long> V;
int p;
cin >> p;
for (int j = 1; j <= p; j++) {
long long t;
cin >> t;
V.push_back(t);
}
if (V.size() % 2 == 1) X.push_back(V[V.size() / 2]);
for (int j = 0; j < V.size() / 2; j++) {
a += V[j];
b += V[V.size() - j - 1];
}
}
sort(X.begin(), X.end());
reverse(X.begin(), X.end());
for (int i = 0; i < X.size(); i += 2) a += X[i];
for (int i = 1; i < X.size(); i += 2) b += X[i];
cout << a << " " << b << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long f1, f2;
vector<int> vec;
f1 = f2 = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
for (int j = 0; j < s; j++) {
int c;
cin >> c;
if (s % 2 == 1 && j == s / 2)
vec.push_back(c);
else if (j < s / 2)
f1 += c;
else
f2 += c;
}
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); i++)
if (i % 2 == 0)
f1 += vec[i];
else
f2 += vec[i];
cout << f1 << " " << f2 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
char ch;
inline void read(int &x) {
x = 0;
ch = getchar();
while (ch <= 32) ch = getchar();
while (ch > 32) {
x = x * 10 + ch - 48;
ch = getchar();
};
};
int n;
int a[105];
int main() {
int i, j;
read(n);
int ans1 = 0, ans2 = 0;
int cnt = 0;
for (i = 1; i <= n; i++) {
int s, x;
read(s);
for (j = s / 2; j >= 1; j--) {
read(x);
ans1 += x;
};
if (s & 1) {
read(x);
a[++cnt] = x;
};
for (j = s / 2; j >= 1; j--) {
read(x);
ans2 += x;
};
};
std::sort(a + 1, a + cnt + 1);
for (i = cnt; i >= 1; i -= 2) {
ans1 += a[i];
};
for (i = cnt - 1; i >= 1; i -= 2) {
ans2 += a[i];
};
printf("%d %d\n", ans1, ans2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, a, c1 = 0, c2 = 0;
vector<int> v;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x & 1) {
x /= 2;
for (int j = 1; j <= x; j++) {
cin >> a;
c1 += a;
}
cin >> a;
v.push_back(a);
for (int j = 1; j <= x; j++) {
cin >> a;
c2 += a;
}
} else {
x /= 2;
for (int j = 1; j <= x; j++) {
cin >> a;
c1 += a;
}
for (int j = 1; j <= x; j++) {
cin >> a;
c2 += a;
}
}
}
sort(v.begin(), v.end());
int i = v.size() - 1;
while (i >= 0) {
c1 += v[i];
i--;
if (i == -1) break;
c2 += v[i];
i--;
}
cout << c1 << " " << c2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, n, x = 0, y = 0, a;
cin >> N;
vector<int> V;
for (int i = 0; i < N; i++) {
cin >> n;
for (int j = 0; j < n; j++) {
cin >> a;
if (n % 2 == 1) {
if (j == floor(n / 2.0))
V.push_back(-a);
else {
if (j < (n / 2.0))
x += a;
else
y += a;
}
} else {
if (j < (n / 2.0))
x += a;
else
y += a;
}
}
}
sort(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
if (i % 2)
y += (-V[i]);
else
x += (-V[i]);
}
cout << x << " " << y << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 10;
int n;
int a[maxn], stk[maxn], cnt;
int A, B;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
for (int j = 1; j <= k; j++) scanf("%d", &a[j]);
for (int j = 1; j <= k / 2; j++) A += a[j];
for (int j = (k + 1) / 2 + 1; j <= k; j++) B += a[j];
if (k & 1) stk[++cnt] = a[(k + 1) / 2];
}
sort(stk + 1, stk + 1 + cnt);
reverse(stk + 1, stk + 1 + cnt);
for (int i = 1; i <= n; i++)
if (i & 1)
A += stk[i];
else
B += stk[i];
printf("%d %d\n", A, B);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 105;
int n, s, c[maxN], sum1, sum2;
vector<int> d;
bool cmp(int A, int B) { return A > B; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
for (int j = 1; j <= s; j++) cin >> c[j];
for (int j = 1; j <= s / 2; j++) sum1 += c[j];
for (int j = (s + 1) / 2 + 1; j <= s; j++) sum2 += c[j];
if (s % 2 == 1) d.push_back(c[(s + 1) / 2]);
}
sort(d.begin(), d.end(), cmp);
for (int i = 0; i < d.size(); i++)
if (i % 2 == 0)
sum1 += d[i];
else
sum2 += d[i];
cout << sum1 << " " << sum2;
return 0;
}
| 9 | CPP |
N = int(input())
one = two = 0
middles = []
for i in range(N):
array = list(map(int, input().split()))[1:]
size = len(array)-1
middle = size//2
for i in range(middle):
one += array[i]
for i in range(middle+1, len(array)):
two += array[i]
if len(array)%2==1:
middles.append(array[middle])
else:
one += array[middle]
middles = sorted(middles)
ONE = True
for i in range(len(middles)-1, -1, -1):
if ONE:
one += middles[i]
ONE = False
else:
two += middles[i]
ONE = True
print(one, two)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int i, j, a = 0, b = 0, c, k, n;
std::vector<int> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> k;
for (j = 0; j < k / 2; j++) cin >> c, a += c;
if (k & 1) cin >> c, v.push_back(c);
for (j = 0; j < k / 2; j++) cin >> c, b += c;
}
sort(v.begin(), v.end(), greater<int>());
for (i = 0; i < v.size(); i++)
if (i & 1)
b += v[i];
else
a += v[i];
cout << a << " " << b;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, w[101], i, j, S, Sum, k, C, a, t;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &k);
for (j = 1; j <= k; j++) {
scanf("%d", &a);
Sum += a;
t = j * 2 - k;
if (t == 1)
w[C++] = -a;
else if (t <= 0)
S += a;
}
}
sort(w, w + C);
for (i = 0; i < C; i += 2) S -= w[i];
printf("%d %d\n", S, Sum - S);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;
int N;
int second[MAXN];
int arr[MAXN][MAXN];
int lb[MAXN], rb[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> second[i];
for (int j = 0; j < second[i]; j++) cin >> arr[i][j];
lb[i] = 0;
rb[i] = second[i];
}
int s1 = 0, s2 = 0;
int turn = 0;
while (1) {
int bst = -1, bstval = 0;
for (int i = 0; i < N; i++) {
if (lb[i] == rb[i]) continue;
int mb = lb[i] + rb[i];
int pos;
if (mb % 2 == 0) {
if (turn == 0)
pos = mb / 2;
else
pos = mb / 2 - 1;
} else
pos = (mb - 1) / 2;
if (arr[i][pos] > bstval) {
bstval = arr[i][pos];
bst = i;
}
}
if (bst == -1) break;
if (turn == 0)
s1 += arr[bst][lb[bst]++];
else
s2 += arr[bst][--rb[bst]];
turn ^= 1;
}
cout << s1 << " " << s2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 100;
vector<int> a[N];
void addup(int v[], vector<int> &xs) {
for (int i = 0, p = 0; i < xs.size(); ++i) {
if (i == xs.size() / 2) ++p;
v[p] += xs[i];
}
}
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int sz;
cin >> sz;
for (int j = 0; j < sz; ++j) {
int x;
cin >> x;
a[i].push_back(x);
}
}
int v[] = {0, 0};
for (int i = 0; i < n; ++i) {
if (a[i].size() & 1) continue;
addup(v, a[i]);
}
vector<int> mids;
for (int i = 0; i < n; ++i) {
if (not(a[i].size() & 1)) continue;
int midp = a[i].size() / 2;
mids.push_back(a[i][midp]);
swap(a[i][midp], a[i][a[i].size() - 1]);
a[i].pop_back();
addup(v, a[i]);
}
sort(mids.begin(), mids.end());
reverse(mids.begin(), mids.end());
for (int i = 0, p = 0; i < mids.size(); ++i) {
v[p] += mids[i];
p = 1 - p;
}
cout << v[0] << ' ' << v[1] << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
void shell(int vec[], int n);
int main(int argc, char const *argv[]) {
int pilas, i, j;
scanf("%d", &pilas);
int pil[100], cant = 0;
int N, suma1 = 0, suma2 = 0, valor, medio;
for (i = 0; i < pilas; i++) {
scanf("%d", &N);
medio = N / 2;
for (j = 0; j < N; j++) {
scanf("%d", &valor);
if (medio > j) {
suma1 += valor;
} else if (medio == j && N % 2 == 1) {
pil[cant] = valor;
cant++;
} else {
suma2 += valor;
}
}
}
shell(pil, cant);
i = cant - 1;
int selec = 0;
while (i >= 0) {
if (selec % 2 == 0) {
suma1 += pil[i];
} else {
suma2 += pil[i];
}
i--;
selec++;
}
printf("%d %d", suma1, suma2);
return 0;
}
void shell(int vec[], int n) {
for (int salto = n / 2; salto > 0; salto /= 2) {
for (int i = salto; i < n; i += 1) {
int aux = vec[i], j;
for (j = i; (j >= salto) && (vec[j - salto] > aux); j -= salto)
vec[j] = vec[j - salto];
vec[j] = aux;
}
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MX = 100005, INF = 1000000000;
const long long int LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
vector<int> x[105];
int main() {
int n, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int a;
scanf("%d", &a);
x[i].push_back(a);
}
}
vector<int> d;
int s = 0, t = 0;
for (int i = 0; i < n; i++) {
m = x[i].size();
for (int j = 0; j < m / 2; j++) s += x[i][j], t += x[i][m - j - 1];
if (m & 1) d.push_back(x[i][m / 2]);
}
sort(d.begin(), d.end());
reverse(d.begin(), d.end());
for (int i = 0; i < d.size(); i++) {
if (i & 1)
t += d[i];
else
s += d[i];
}
cout << s << " " << t << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int n;
int a1, a2;
int s1[MAXN], s2[MAXN];
int marc[MAXN];
int mid[MAXN];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int tam;
scanf("%d", &tam);
for (int j = 1; j <= tam; j++) {
int aux;
scanf("%d", &aux);
if (tam % 2 == 1 && j == (tam + 1) / 2)
mid[i] = aux;
else if (j <= tam / 2)
a1 += aux;
else if (j > tam / 2)
a2 += aux;
}
if (tam % 2 == 0) marc[i] = 1;
}
bool turn = true;
while (1) {
bool flag = true;
int maxi = 0, id = 0;
for (int i = 1; i <= n; i++) {
if (marc[i]) continue;
flag = false;
if (turn && mid[i] > maxi) maxi = mid[i], id = i;
if (!turn && mid[i] > maxi) maxi = mid[i], id = i;
}
if (flag) break;
if (turn)
a1 += mid[id];
else
a2 += mid[id];
marc[id] = 1;
turn ^= 1;
}
printf("%d %d\n", a1, a2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int first = 0, second = 0;
vector<int> a;
while (n--) {
int k, x;
cin >> k;
for (int i = 1; i <= k / 2; i++) {
cin >> x;
first += x;
}
if (k % 2) {
cin >> x;
a.push_back(x);
}
for (int i = 1; i <= k / 2; i++) {
cin >> x;
second += x;
}
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
bool k = true;
for (auto it : a) {
if (k)
first += it;
else
second += it;
k = !k;
}
cout << first << " " << second << endl;
}
| 9 | CPP |
from sys import stdin
from collections import deque
import heapq
n = int(stdin.readline())
piles = []
for x in range(n):
a = [int(x) for x in stdin.readline().split()][1:]
piles.append(a)
cielTotal = 0
jiroTotal = 0
mids = []
for x in piles:
cielTotal += sum(x[:len(x)//2])
jiroTotal += sum(x[len(x)//2+len(x)%2:])
#print(x)
#print(cielTotal,jiroTotal)
if len(x)%2 == 1:
mids.append(x[len(x)//2])
mids.sort(reverse=True)
turn = True
for x in mids:
if turn:
cielTotal += x
else:
jiroTotal += x
turn = not turn
print(cielTotal,jiroTotal)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> rems;
int ans[2];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int p;
cin >> p;
if (j < m / 2)
ans[0] += p;
else if (j >= (m + 1) / 2)
ans[1] += p;
else {
rems.push_back(p);
}
}
}
sort(rems.begin(), rems.end());
reverse(rems.begin(), rems.end());
for (int i = 0; i < rems.size(); i++) {
ans[i % 2] += rems[i];
}
cout << ans[0] << " " << ans[1] << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> m;
int main() {
int n;
cin >> n;
int top = 0;
int bottom = 0;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
for (int j = 0; j < c; j++) {
int a;
cin >> a;
if (c % 2 == 0 && j < c / 2)
top += a;
else if (c % 2 == 0)
bottom += a;
else if (j < c / 2)
top += a;
else if (j == c / 2)
m.push_back(a);
else
bottom += a;
}
}
sort(m.rbegin(), m.rend());
for (int i = 0; i < m.size(); i++) {
if (i % 2 == 0)
top += m[i];
else
bottom += m[i];
}
cout << top << " " << bottom << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &a) {
T w = 1;
a = 0;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') w = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar()) a = (a * 10) + (ch - '0');
a *= w;
}
template <typename T>
inline void ckmax(T &a, T b) {
a = a > b ? a : b;
}
template <typename T>
inline void ckmin(T &a, T b) {
a = a < b ? a : b;
}
priority_queue<int> q;
int main() {
int n;
read(n);
int Ansa = 0, Ansb = 0;
for (int i = 1; i <= n; ++i) {
int xx, vis;
read(xx);
if (xx & 1) {
for (int j = 1; j <= xx / 2; ++j) {
read(vis);
Ansa += vis;
}
read(vis);
q.push(vis);
for (int j = xx / 2 + 2; j <= xx; ++j) {
read(vis);
Ansb += vis;
}
} else {
for (int j = 1; j <= xx / 2; ++j) {
read(vis);
Ansa += vis;
}
for (int j = xx / 2 + 1; j <= xx; ++j) {
read(vis);
Ansb += vis;
}
}
}
int flag = 0;
while (!q.empty()) {
int x = q.top();
q.pop();
if (flag) Ansb += x;
if (!flag) Ansa += x;
flag ^= 1;
}
printf("%d %d", Ansa, Ansb);
}
| 9 | CPP |
#include <bits/stdc++.h>
const long long MAX_N = 1e3 + 100;
const long long MOD = 1e9 + 7;
using namespace std;
int a[MAX_N];
int ans1, ans2;
int main() {
int m;
cin >> m;
vector<int> vc;
for (int k = 1; k <= m; ++k) {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 1; i <= n / 2; ++i) ans1 += a[i];
for (int i = n; i >= n - n / 2 + 1; --i) ans2 += a[i];
if (n & 1) vc.push_back(a[n / 2 + 1]);
}
sort(vc.begin(), vc.end());
reverse(vc.begin(), vc.end());
for (int i = 0; i < vc.size(); ++i) {
if (i & 1)
ans2 += vc[i];
else
ans1 += vc[i];
}
cout << ans1 << " " << ans2;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int m[105];
int ms = 0;
int k[105];
int main() {
int n;
scanf("%d", &n);
int A = 0, B = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &k[i]);
for (int j = 0; j < k[i]; j++) {
int x;
scanf("%d", &x);
if (j < k[i] / 2)
A += x;
else if (j >= (k[i] + 1) / 2)
B += x;
else
m[ms++] = x;
}
}
sort(m, m + ms);
reverse(m, m + ms);
for (int i = 0; i < ms; i++)
if ((i & 1) == 0)
A += m[i];
else
B += m[i];
printf("%d %d", A, B);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
multiset<int> S;
int main() {
int n;
int x = 0, y = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int k;
scanf("%d", &k);
for (int j = 1; j <= k; j++) {
int t;
scanf("%d", &t);
if (j <= k / 2)
x += t;
else if (j > (k + 1) / 2)
y += t;
else
S.insert(-t);
}
}
int f = 0;
for (auto v : S) {
if (!f)
x -= v;
else
y -= v;
f ^= 1;
}
printf("%d %d\n", x, y);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
template <typename T>
void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + c - '0';
x *= f;
}
int n;
int cnt[N];
int a[N][N];
int A[N], B[N];
int L[N], R[N];
int val[N];
int ans1, ans2;
bool cmp(int x, int y) { return x > y; }
int main() {
read(n);
for (int i = 1; i <= n; i++) {
read(cnt[i]);
for (int j = 1; j <= cnt[i]; j++) read(a[i][j]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= cnt[i] / 2; j++) ans1 += a[i][j];
for (int i = 1; i <= n; i++)
for (int j = cnt[i] - cnt[i] / 2 + 1; j <= cnt[i]; j++) ans2 += a[i][j];
int tot = 0;
for (int i = 1; i <= n; i++)
if (cnt[i] & 1) val[++tot] = a[i][cnt[i] / 2 + 1];
sort(val + 1, val + tot + 1, cmp);
for (int i = 1; i <= tot; i++)
if (i & 1)
ans1 += val[i];
else
ans2 += val[i];
printf("%d %d\n", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
static const int MAXN = 104;
static const int MAXS = 103;
template <typename T>
inline bool upd_max(T &var, const T val) {
if (var < val) {
var = val;
return true;
} else
return false;
}
int n;
int s[MAXN];
int c[MAXN][MAXS];
int odd_used[MAXN];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &s[i]);
for (int j = 0; j < s[i]; ++j) scanf("%d", &c[i][j]);
odd_used[i] = -1;
}
bool turn = false;
int score[2] = {0, 0};
while (true) {
int best = -1, best_idx = -1;
for (int i = 0; i < n; ++i)
if (s[i] % 2 == 1 && odd_used[i] == -1) {
if (upd_max(best, c[i][s[i] / 2])) best_idx = i;
}
if (best == -1) break;
odd_used[best_idx] = turn;
score[turn] += best;
turn ^= 1;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < s[i] / 2; ++j) score[0] += c[i][j];
for (int j = (s[i] + 1) / 2; j < s[i]; ++j) score[1] += c[i][j];
}
printf("%d %d\n", score[0], score[1]);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
bool cmp(int a, int b) { return a > b; }
int main() {
int n, a = 0, b = 0, rec[110], num_rec = 0;
scanf("%d", &n);
for (int i = 1, num, buf[110]; i <= n; i++) {
scanf("%d", &num);
for (int j = 1; j <= num; j++) scanf("%d", &buf[j]);
for (int j = 1; j <= (num >> 1); j++) a += buf[j];
if (num & 1) {
for (int j = (num >> 1) + 2; j <= num; j++) b += buf[j];
rec[++num_rec] = buf[(num >> 1) + 1];
} else
for (int j = (num >> 1) + 1; j <= num; j++) b += buf[j];
}
std::sort(rec + 1, rec + num_rec + 1, cmp);
for (int i = 1; i <= num_rec; i++)
if (i & 1)
a += rec[i];
else
b += rec[i];
printf("%d %d\n", a, b);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int l, s[1024];
int sf, ss;
vector<int> r;
int main() {
scanf("%d", &n);
sf = ss = 0;
r.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &l);
for (int j = 0; j < l; ++j) {
scanf("%d", &s[j]);
}
int b = 0, e = l - 1;
while (b < e) {
sf += s[b++];
ss += s[e--];
}
if (b == e) {
r.push_back(s[b]);
}
}
sort(r.begin(), r.end());
int j = 0;
for (int i = (int)r.size() - 1; i >= 0; --i) {
if (j & 1)
ss += r[i];
else
sf += r[i];
++j;
}
printf("%d %d\n", sf, ss);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int A, B, n, m, s, a, q[111];
int main() {
cin >> n;
while (n--) {
cin >> s;
for (int i = 1; i <= s; ++i) {
cin >> a;
if (2 * i <= s)
A += a;
else if (2 * i == s + 1)
q[m++] = a;
else
B += a;
}
}
sort(q, q + m, greater<int>());
for (int i = 0; i < m; ++i) {
if (i & 1)
B += q[i];
else
A += q[i];
}
cout << A << " " << B << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, A, B;
priority_queue<int> Q;
signed main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1, x; j <= m; j++) {
scanf("%d", &x);
if (m & 1 && j == (m + 1) >> 1)
Q.push(x);
else {
if (j <= m >> 1)
A += x;
else
B += x;
}
}
}
int p = 1;
while (!Q.empty()) p ? A += Q.top() : B += Q.top(), Q.pop(), p ^= 1;
printf("%d %d", A, B);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool comp(int a, int b) { return a > b; }
int main() {
long long n, s, x;
vector<long long> middle;
long long uppe = 0;
long long lowe = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s;
long long m = s / 2;
for (long long j = 0; j < s; j++) {
cin >> x;
if (j < m) uppe += x;
if (s % 2 && j == m) middle.push_back(x);
if (!(s % 2) && j == m) lowe += x;
if (j > m) lowe += x;
}
}
sort(middle.begin(), middle.end(), comp);
for (long long i = 0; i < middle.size(); i++) {
if (!(i % 2)) {
uppe += middle[i];
} else {
lowe += middle[i];
}
}
cout << uppe << " " << lowe << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr;
long long a = 0, b = 0;
while (n--) {
int s;
cin >> s;
for (int i = 0; i < s / 2; i++) {
int x;
cin >> x;
a += x;
}
if (s % 2) {
int x;
cin >> x;
arr.push_back(x);
}
for (int i = 0; i < s / 2; i++) {
int x;
cin >> x;
b += x;
}
}
sort((arr).begin(), (arr).end());
for (int i = 0; i < arr.size(); i++) {
if (i % 2)
b += arr[arr.size() - i - 1];
else
a += arr[arr.size() - i - 1];
}
cout << a << " " << b << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:65777216")
using namespace std;
const long double EPS = 1e-11;
const int INF = 2000000000;
const long long lINF = 9223372036854775800;
const long double PI = 3.14159265358979323846;
const int MAXN = 4000;
const int BASE = 524288 * 2;
const long long MOD = 1000000007;
int main() {
int n, m, a[101][101], s[101], f[101], i, j, ans1 = 0, ans2 = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
s[i] = 0;
f[i] = m - 1;
}
while (true) {
int mx = 0, mxi;
for (i = 0; i < n; i++) {
if (s[i] > f[i]) continue;
m = (s[i] + f[i]) / 2;
if ((f[i] - s[i]) % 2 == 1) m++;
if (mx < a[i][m]) {
mx = a[i][m];
mxi = i;
}
}
if (mx == 0) break;
for (i = 0; i < n; i++) {
if (s[i] > f[i]) continue;
m = (s[i] + f[i]) / 2;
if ((f[i] - s[i]) % 2 == 1) m++;
if (a[i][m] == mx) {
ans1 += a[i][s[i]];
s[i]++;
break;
}
}
mx = 0;
for (i = 0; i < n; i++) {
if (s[i] > f[i]) continue;
m = (s[i] + f[i]) / 2;
if (mx < a[i][m]) {
mx = a[i][m];
mxi = i;
}
}
if (mx == 0) break;
for (i = 0; i < n; i++) {
if (s[i] > f[i]) continue;
m = (s[i] + f[i]) / 2;
if (a[i][m] == mx) {
ans2 += a[i][f[i]];
f[i]--;
break;
}
}
}
cout << ans1 << ' ' << ans2;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
struct data {
int num;
int init;
};
bool byNum(const data &left, const data &right) { return left.num > right.num; }
bool descend(const int &left, const int &right) { return left > right; }
data total[105];
pair<int, int> pile[105];
int sisa[105], card[105];
int main(void) {
int temp, n, i, j;
scanf("%d", &n);
for (i = 0; i <= n - 1; i++) {
scanf("%d", &card[i]);
sisa[i] = 0;
for (j = 0; j <= card[i] / 2 - 1; j++) {
scanf("%d", &temp);
pile[i].first += temp;
}
if (card[i] % 2) {
scanf("%d", &temp);
sisa[i] = temp;
}
for (j = 0; j <= card[i] / 2 - 1; j++) {
scanf("%d", &temp);
pile[i].second += temp;
}
total[i].num = pile[i].first + sisa[i] + pile[i].second;
total[i].init = i;
}
sort(total, total + n, byNum);
sort(sisa, sisa + n, descend);
long long a = 0, b = 0;
for (i = 0; i <= n - 1; i++) {
a += pile[total[i].init].first;
b += pile[total[i].init].second;
}
for (i = 0; i <= n - 1; i++) {
if (i % 2)
b += sisa[i];
else
a += sisa[i];
if (!sisa[i]) break;
}
cout << a << " " << b << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int sc1, sc2;
int sz;
int s;
int a[200];
int b[200];
int main() {
sz = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &s);
for (int j = 0; j < s; j++) scanf("%d", &a[j]);
if (s % 2 == 1) {
b[sz] = a[s / 2];
sz++;
}
for (int j = 0; j < s / 2; j++) sc1 += a[j];
for (int j = (s + 1) / 2; j < s; j++) sc2 += a[j];
}
sort(b, b + sz);
if (sz % 2 == 1) {
for (int i = 0; i < sz; i++) {
if (i % 2 == 0)
sc1 += b[i];
else
sc2 += b[i];
}
} else {
for (int i = 0; i < sz; i++) {
if (i % 2 == 1)
sc1 += b[i];
else
sc2 += b[i];
}
}
printf("%d %d\n", sc1, sc2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int n;
cin >> n;
int s1 = 0, s2 = 0;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int a;
cin >> a;
if (j == x / 2 && x & 1) {
v.push_back(a);
continue;
}
if (j < x / 2) {
s1 += a;
} else {
s2 += a;
}
}
}
sort(v.begin(), v.end(), greater<int>());
for (int i = 0; i < v.size(); i++) {
if (i & 1) {
s2 += v[i];
} else {
s1 += v[i];
}
}
cout << s1 << " " << s2;
return 0;
}
| 9 | CPP |
n = int(input())
a,b = 0,0
l = []
for _ in range(n):
inpt = list(map(int,input().split()))[1:]
li = len(inpt)
if li%2:
l.append(inpt[li//2])
a += sum((inpt[:li//2]))
b += sum((inpt[(li + 1)//2:]))
l.sort(reverse=True)
a += sum(l[::2])
b += sum(l[1::2])
print(a, b) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 111;
inline bool cmp(int x, int y) { return x > y; }
inline int read() {
char ch = getchar();
int x = 0;
while (!isdigit(ch)) ch = getchar();
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return x;
}
int n, a[maxn], ans0, ans1, tot, x;
int main() {
n = read();
ans0 = ans1 = tot = 0;
for (int i = 1; i <= n; ++i) {
for (int i = (x = read()) >> 1; i; --i) ans0 += read();
if (x & 1) a[++tot] = read();
for (int i = x >> 1; i; --i) ans1 += read();
}
sort(a + 1, a + tot + 1, cmp);
for (int i = 1; i <= n; i += 2) ans0 += a[i];
for (int i = 2; i <= n; i += 2) ans1 += a[i];
printf("%d %d\n", ans0, ans1);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int v[150][150];
int s[150];
int ans1 = 0, ans2 = 0;
int pi = 0;
int p[150];
bool cmp(const int &a, const int &b) { return a > b; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &s[i]);
for (int j = 1; j <= s[i]; ++j) {
scanf("%d", &v[i][j]);
}
if (s[i] & 1) {
int t = s[i] / 2;
for (int j = 1; j <= t; ++j) {
ans1 += v[i][j];
}
for (int j = t + 2; j <= s[i]; ++j) {
ans2 += v[i][j];
}
p[++pi] = v[i][t + 1];
} else {
int t = s[i] / 2;
for (int j = 1; j <= t; ++j) {
ans1 += v[i][j];
}
for (int j = t + 1; j <= s[i]; ++j) {
ans2 += v[i][j];
}
}
}
sort(p + 1, p + pi + 1, cmp);
for (int i = 1; i <= pi; ++i) {
if (i & 1)
ans1 += p[i];
else
ans2 += p[i];
}
printf("%d %d", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int n, Ciel(0), Jiro(0), rem[105];
int main() {
scanf("%d", &n);
for (int s, i = 0; i < n; i++) {
scanf("%d", &s);
for (int c, j = 0; j < s; j++) {
scanf("%d", &c);
if (s % 2 && j == s / 2)
rem[++rem[0]] = c;
else if (j < s / 2)
Ciel += c;
else
Jiro += c;
}
}
if (rem[0]) {
std::sort(rem + 1, rem + rem[0] + 1);
for (int i = rem[0]; i; i--)
if ((rem[0] - i) % 2)
Jiro += rem[i];
else
Ciel += rem[i];
}
printf("%d %d\n", Ciel, Jiro);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v[105];
int main() {
long long n;
cin >> n;
for (long long i = (long long)1; i <= (long long)n; i++) {
long long s;
cin >> s;
for (long long j = (long long)1; j <= (long long)s; j++) {
long long c;
cin >> c;
v[i].push_back(c);
}
}
long long a = 0, b = 0;
vector<long long> grab;
for (long long i = (long long)1; i <= (long long)n; i++) {
if (v[i].size() % 2) {
for (long long j = (long long)0; j <= (long long)(v[i].size() / 2) - 1;
j++)
a += v[i][j];
for (long long j = (long long)(v[i].size() / 2) + 1;
j <= (long long)v[i].size() - 1; j++)
b += v[i][j];
grab.push_back(v[i][v[i].size() / 2]);
} else {
for (long long j = (long long)0; j <= (long long)(v[i].size() / 2) - 1;
j++)
a += v[i][j];
for (long long j = (long long)(v[i].size() / 2);
j <= (long long)v[i].size() - 1; j++)
b += v[i][j];
}
}
sort(grab.rbegin(), grab.rend());
for (long long i = (long long)0; i <= (long long)grab.size() - 1; i++) {
if (i & 1)
b += grab[i];
else
a += grab[i];
}
cout << a << ' ' << b;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) { return a > b; }
int n, ans1, ans2, i, j, mid, num, a, cnt, cut[1001];
int main() {
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
scanf("%d", &num);
mid = num >> 1;
for (j = 1; j <= mid; ++j) {
scanf("%d", &a);
ans1 += a;
}
if (num & 1) {
scanf("%d", &a);
cut[++cnt] = a;
j++;
}
for (; j <= num; ++j) {
scanf("%d", &a);
ans2 += a;
}
}
sort(cut + 1, cut + 1 + cnt, cmp);
for (i = 1; i <= cnt; ++i)
if (i & 1)
ans1 += cut[i];
else
ans2 += cut[i];
printf("%d %d\n", ans1, ans2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans1 = 0, ans2 = 0;
vector<int> tbd;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
vector<int> g(s);
for (int j = 0; j < s; j++) cin >> g[j];
if (s % 2 == 0) {
for (int j = 0; j < s / 2; j++) {
ans1 += g[j];
}
for (int j = s / 2; j < s; j++) {
ans2 += g[j];
}
} else {
for (int j = 0; j < s / 2; j++) {
ans1 += g[j];
}
for (int j = s / 2 + 1; j < s; j++) {
ans2 += g[j];
}
tbd.push_back(g[s / 2]);
}
}
sort(tbd.rbegin(), tbd.rend());
for (int i = 0; i < tbd.size(); i++) {
if (i % 2 == 0) {
ans1 += tbd[i];
} else {
ans2 += tbd[i];
}
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[107];
int le[107], ri[107];
int n;
int main() {
while (scanf("%d", &n) != EOF) {
int to, bo;
to = bo = 0;
int num = 0;
int len = 0;
for (int i = 0; i < n; i++) {
le[i] = 0;
scanf("%d", &ri[i]);
num = ri[i] / 2;
for (int j = 0; j < num; j++) {
int x;
scanf("%d", &x);
to += x;
}
if (ri[i] % 2) {
int x;
scanf("%d", &x);
a[len++] = x;
}
for (int j = 0; j < num; j++) {
int x;
scanf("%d", &x);
bo += x;
}
}
int swi = 0;
sort(a, a + len);
for (int i = len - 1; i >= 0; i--) {
if (swi == 0) {
swi = 1;
to += a[i];
} else {
swi = 0;
bo += a[i];
}
}
printf("%d %d\n", to, bo);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
template <class T>
inline T sqr(T x) {
return x * x;
}
template <class T>
inline string tostr(const T &x) {
stringstream ss;
ss << x;
return ss.str();
}
const long double EPS = 1e-10;
const int INF = 1000 * 1000 * 1000;
const char CINF = 102;
const long long LINF = INF * 1ll * INF;
const long double DINF = 1e200;
const long double PI = 3.1415926535897932384626433832795l;
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long p, long long m) {
long long r = 1;
while (p) {
if (p & 1) r = r * a % m;
p >>= 1;
a = a * a % m;
}
return r;
}
long long myabs(long long a) { return a < 0 ? -a : a; }
struct vec {
long long x, y, z;
vec() {}
vec(long long x, long long y, long long z) : x(x), y(y), z(z) {}
void read() { cin >> x >> y >> z; }
long long dot(const vec &b) const { return x * b.x + y * b.y + z * b.z; }
vec operator-(const vec &b) const { return vec(x - b.x, y - b.y, z - b.z); }
vec operator+(const vec &b) const { return vec(x + b.x, y + b.y, z + b.z); }
vec cross(const vec &b) const {
return vec(y * b.z - z * b.y, b.x * z - b.z * x, x * b.y - y * b.x);
}
bool operator!() const { return !x && !y && !z; }
bool operator<(const vec &b) const {
return make_pair(make_pair(x, y), z) < make_pair(make_pair(b.x, b.y), b.z);
}
vec operator-() const { return vec(-x, -y, -z); }
vec norm() const {
vec r = *this;
if (r < vec(0, 0, 0)) r = -r;
long long g = gcd(gcd(myabs(x), myabs(y)), myabs(z));
r.x /= g;
r.y /= g;
r.z /= g;
return r;
}
bool operator==(const vec &b) const {
return x == b.x && y == b.y && z == b.z;
}
};
struct frac {
long long a, b;
void norm() {
if (b < 0) {
b *= -1;
a *= -1;
}
long long g = gcd(abs(a), b);
a /= g;
b /= g;
}
frac() {}
frac(long long a, long long b = 1) : a(a), b(b) { norm(); }
frac operator+(const frac &f) const {
return frac(a * f.b + b * f.a, b * f.b);
}
frac operator*(const frac &f) const { return frac(a * f.a, b * f.b); }
bool operator<(const frac &f) const {
return make_pair(a, b) < make_pair(f.a, f.b);
}
bool operator==(const frac &f) const { return a == f.a && b == f.b; }
};
struct fvec {
frac x, y, z;
fvec() {}
fvec(frac x, frac y, frac z) : x(x), y(y), z(z) {}
fvec(const vec &v) : x(v.x), y(v.y), z(v.z) {}
fvec operator*(frac &f) const { return fvec(x * f, y * f, z * f); }
fvec operator+(const fvec &b) const {
return fvec(x + b.x, y + b.y, z + b.z);
}
bool operator<(const fvec &b) const {
return make_pair(make_pair(x, y), z) < make_pair(make_pair(b.x, b.y), b.z);
}
bool operator==(const fvec &b) const {
return x == b.x && y == b.y && z == b.z;
}
};
struct plane {
vec n;
long long d;
vec v1, v2;
bool init(const vec &a, const vec &b, const vec &c, const vec &dd,
fvec &inters) {
v1 = (b - a).norm();
v2 = (c - dd).norm();
n = v1.cross(v2);
if (!n) return false;
n = n.norm();
d = n.dot(a);
if (n.dot(c) != d) return false;
vec tn = vec(0, 0, 1).cross(v2);
frac t((c - a).dot(tn), v1.dot(tn));
inters = fvec(a) + fvec(v1) * t;
return true;
}
bool operator<(const plane &b) const {
return make_pair(n, d) < make_pair(b.n, b.d);
}
};
int n;
pair<vec, vec> A[1100];
int main() {
int n;
cin >> n;
vector<int> v;
int s1 = 0, s2 = 0;
for (int i = 0; i < (n); ++i) {
int k;
cin >> k;
for (int j = 0; j < (k); ++j) {
int a;
cin >> a;
if (k % 2 && j == k / 2) {
v.push_back(a);
} else if (j < k / 2)
s1 += a;
else
s2 += a;
}
}
sort((v).begin(), (v).end());
reverse((v).begin(), (v).end());
for (int i = 0; i < (((int)(v).size())); ++i) {
if (i % 2)
s2 += v[i];
else
s1 += v[i];
}
cout << s1 << ' ' << s2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
int main() {
int n, totalSum = 0, firstSum = 0;
vector<int> middleValues;
cin >> n;
for (; n > 0; --n) {
int size;
cin >> size;
vector<int> values = vector<int>(size);
for (int i = 0; i < size; ++i) {
cin >> values[i];
totalSum += values[i];
if (i < size / 2) firstSum += values[i];
}
if (size % 2 == 1) middleValues.push_back(values[size / 2]);
}
sort(middleValues.rbegin(), middleValues.rend());
for (int i = 0; i < int(middleValues.size()); i += 2)
firstSum += middleValues[i];
cout << firstSum << " " << totalSum - firstSum << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> V;
int main(void) {
int n;
scanf("%d", &n);
int suma = 0, sumb = 0;
for (; n; n--) {
int x;
scanf("%d", &x);
for (int i = 0; i < x; i++) {
int z;
scanf("%d", &z);
if (x % 2 == 1) {
if (i == x / 2)
V.push_back(z);
else if (i < x / 2)
suma += z;
else
sumb += z;
} else {
if (i < x / 2)
suma += z;
else
sumb += z;
}
}
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
for (int i = 0; i < V.size(); i++) {
if (i % 2 == 0)
suma += V[i];
else
sumb += V[i];
}
printf("%d %d\n", suma, sumb);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d ", &n);
pair<int, int> res = pair<int, int>(0, 0);
vector<int> aux, g;
for (int i = 0; i < n; i++) {
int s;
scanf("%d ", &s);
g.assign(s, 0);
for (int j = 0; j < s; j++) scanf("%d ", &g[j]);
;
for (int j = 0; j < s / 2; j++) res.first += g[j];
reverse(g.begin(), g.end());
for (int j = 0; j < s / 2; j++) res.second += g[j];
if (s % 2) aux.push_back(g[s / 2]);
}
sort(aux.begin(), aux.end());
reverse(aux.begin(), aux.end());
for (int i = 0; i < aux.size(); i++)
if (i % 2)
res.second += aux[i];
else
res.first += aux[i];
printf("%d %d", res.first, res.second);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
namespace RA {
int r(int p) { return 1ll * rand() * rand() % p; }
int r(int L, int R) { return r(R - L + 1) + L; }
} // namespace RA
int n;
int a[1000], b[1000], lb;
int A, B;
int main() {
scanf("%d", &n);
for (int i = (1); i <= (n); ++i) {
int x;
scanf("%d", &x);
for (int i = (1); i <= (x); ++i) scanf("%d", &a[i]);
for (int i = 1, j = x; i < j; i++, j--) A += a[i], B += a[j];
if (x & 1) b[++lb] = a[x / 2 + 1];
}
sort(b + 1, b + lb + 1);
reverse(b + 1, b + lb + 1);
for (int i = (1); i <= (lb); ++i) i& 1 ? A += b[i] : B += b[i];
printf("%d %d\n", A, B);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n;
int s[N];
vector<int> rem;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
int sum1 = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i]; j++) {
int x;
cin >> x;
if (j < s[i] / 2) {
sum1 += x;
} else if (j == s[i] / 2 && s[i] & 1) {
rem.push_back(x);
} else {
sum2 += x;
}
}
}
sort(rem.begin(), rem.end(), greater<int>());
for (int i = 0; i < (int)rem.size(); i++) {
if (i & 1)
sum2 += rem[i];
else
sum1 += rem[i];
}
cout << sum1 << ' ' << sum2 << '\n';
return 0;
}
| 9 | CPP |
n=int(input())
s1,s2=0,0
tab = []
for i in range(n):
c = list(map(int,input().split()))
for j in range(1,c[0]+1):
if(j*2<=c[0]): s1+=c[j]
else: s2+=c[j]
if(c[0] & 1):
s2-=c[(c[0]+1)//2]
tab.append(c[(c[0]+1)//2])
if(len(tab)):
tab.sort()
tab.reverse()
for i in range(len(tab)):
if(i & 1): s2+=tab[i]
else: s1+=tab[i]
print(s1,s2)
# Made By Mostafa_Khaled | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 111;
int c[N][N];
int r[N];
int n;
int main() {
ios::sync_with_stdio(false);
cout.precision(10);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> r[i];
for (int j = 1; j <= r[i]; j++) {
cin >> c[i][j];
}
}
priority_queue<int> q;
int aans = 0, bans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= r[i]; j++) {
if (r[i] & 1 && j == r[i] + 1 >> 1) {
q.push(c[i][j]);
} else if (j <= r[i] >> 1) {
aans += c[i][j];
} else {
bans += c[i][j];
}
}
}
bool turn = true;
while (q.size()) {
if (turn) {
aans += q.top();
} else {
bans += q.top();
}
q.pop();
turn = !turn;
}
cout << aans << " " << bans << "\n";
return 0;
}
| 9 | CPP |
chef_sum = 0
ramsay_sum = 0
odds_mids = []
for n in range(int(input())):
c, *c_list = map(int, input().split())
if c%2 == 1:
odds_mids.append(c_list.pop(c//2))
for index,element in enumerate(c_list):
if index < len(c_list)/2:
chef_sum += element
else:
ramsay_sum += element
odds_mids.sort(reverse = True)
for index, element in enumerate(odds_mids):
if index%2 == 0:
chef_sum += element
else:
ramsay_sum += element
print(chef_sum, ramsay_sum) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 5;
const int inf = 0x3f3f3f3f;
int n, m, a[maxn], tt[maxn];
long long sua, sub;
int main() {
scanf("%d", &n);
int pr = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1; j <= m; j++) scanf("%d", a + j);
if (m & 1) tt[++pr] = a[m / 2 + 1];
int l = 1, r = m;
while (l < r) {
sua += a[l++];
sub += a[r--];
}
}
sort(tt + 1, tt + pr + 1);
int flag = 1;
for (int i = pr; i > 0; i--) {
if (flag++ & 1)
sua += tt[i];
else
sub += tt[i];
}
printf("%lld %lld\n", sua, sub);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void _fill_int(int* p, int val, int rep) {
int i;
for (i = 0; i < rep; i++) p[i] = val;
}
signed long long GETi() {
signed long long i;
scanf("%lld", &i);
return i;
}
int N;
int S[101];
vector<int> V;
void solve() {
int f, i, j, k, l, x, y;
int sa = 0, sb = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> S[i];
for (j = 0; j < S[i]; j++) {
cin >> x;
if (j < S[i] / 2)
sa += x;
else if (S[i] % 2 && j == S[i] / 2)
V.push_back(x);
else
sb += x;
}
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
for (i = 0; i < V.size(); i++) {
if (i % 2)
sb += V[i];
else
sa += V[i];
}
(void)printf("%d %d\n", sa, sb);
}
int main(int argc, char** argv) {
string s;
if (argc == 1) ios::sync_with_stdio(false);
for (int i = 1; i < argc; i++) s += argv[i], s += '\n';
for (int i = s.size() - 1; i >= 0; i--) ungetc(s[i], stdin);
solve();
return 0;
}
| 9 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.