text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int a[2055];
int b[2005];
int c[2005];
int main() {
int n;
scanf("%d", &n);
int q1 = 0, q2 = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
ans += a[i];
if (a[i] % 2)
b[++q1] = a[i];
else
c[++q2] = a[i];
}
sort(b + 1, b + q1 + 1);
sort(c + 1, c + q2 + 1);
if (q1 < q2) {
int sum = 0;
for (int i = 1; i <= q1; i++) sum += b[i];
for (int i = max(1, q2 - q1); i <= q2; i++) sum += c[i];
printf("%d\n", ans - sum);
} else {
int sum = 0;
for (int i = 1; i <= q2; i++) sum += c[i];
for (int i = max(1, q1 - q2); i <= q1; i++) sum += b[i];
printf("%d\n", ans - sum);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
string s;
long long n, m, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int o = 0, e = 0;
vector<int> odds, evens;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x % 2) {
e++;
evens.push_back(x);
} else {
o++;
odds.push_back(x);
}
}
sort(odds.begin(), odds.end());
sort(evens.begin(), evens.end());
if (o == e || o == e + 1 || o + 1 == e) {
cout << 0 << endl;
return 0;
}
if (o == 0) {
long long ans = 0;
for (int i = 0; i < evens.size() - 1; i++) {
ans += evens[i];
}
cout << ans << endl;
return 0;
}
if (e == 0) {
long long ans = 0;
for (int i = 0; i < odds.size() - 1; i++) {
ans += odds[i];
}
cout << ans << endl;
return 0;
}
long long ans = 0;
if (o > e) {
int wan = o - e - 1;
for (int i = 0; i < odds.size(); i++) {
ans += odds[i];
wan--;
if (wan == 0) {
break;
}
}
} else {
int wan = e - o - 1;
for (int i = 0; i < evens.size(); i++) {
ans += evens[i];
wan--;
if (wan == 0) {
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<int> a, b;
int x;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2) {
a.push_back(x);
} else
b.push_back(x);
}
int len = abs((int)a.size() - (int)b.size());
if (len == 0) {
cout << "0" << endl;
} else {
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int ans = 0;
if (a.size() > b.size()) {
for (int i = 0; i < len - 1; i++) ans += a[i];
} else {
for (int i = 0; i < len - 1; i++) {
ans += b[i];
}
}
cout << ans << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int input;
int odd[2000 + 10];
int even[2000 + 10];
int count_even = 0, count_odd = 0;
for (int i = 0; i < n; i++) {
cin >> input;
if (input % 2 == 0) {
even[count_even] = input;
count_even++;
} else {
odd[count_odd] = input;
count_odd++;
}
}
sort(even, even + count_even);
sort(odd, odd + count_odd);
int sum = 0;
int number = abs(count_even - count_odd) - 1;
if (count_even - count_odd > 1) {
for (int i = 0; i < number; i++) sum += even[i];
} else if (count_odd - count_even > 1) {
for (int i = 0; i < number; i++) sum += odd[i];
}
cout << endl << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long sum = 0;
vector<long long> vo;
vector<long long> ve;
stack<long long> so;
stack<long long> se;
int e = 0, o = 0;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 1) {
o++;
vo.push_back(a[i]);
} else {
e++;
ve.push_back(a[i]);
}
}
sort(vo.begin(), vo.end());
sort(ve.begin(), ve.end());
for (int i = 0; i < vo.size(); i++) {
so.push(vo[i]);
}
for (int i = 0; i < ve.size(); i++) {
se.push(ve[i]);
}
if (o == 0) {
for (int i = 0; i < ve.size() - 1; i++) sum += ve[i];
} else if (e == 0) {
for (int i = 0; i < vo.size() - 1; i++) sum += vo[i];
} else if (e == o || e + 1 == o || e == o + 1)
sum = 0;
else if (e > o) {
se.pop();
while (!so.empty()) {
se.pop();
so.pop();
}
while (!se.empty()) {
sum += se.top();
se.pop();
}
} else if (e < o) {
so.pop();
while (!se.empty()) {
se.pop();
so.pop();
}
while (!so.empty()) {
sum += so.top();
so.pop();
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
const int MX = 200001;
int N, M, k;
int arr[MX];
void solve() {
vector<int> o, e;
cin >> N;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x & 1)
o.push_back(x);
else
e.push_back(x);
}
sort(o.begin(), o.end());
sort(e.begin(), e.end());
if (o.size() > e.size()) {
for (int i = 0; i < e.size() + 1; i++) {
o.pop_back();
}
e.clear();
} else if (e.size() > o.size()) {
for (int i = 0; i < o.size() + 1; i++) {
e.pop_back();
}
o.clear();
} else
e.clear(), o.clear();
long long sum = 0;
for (int i = 0; i < e.size(); i++) sum += e[i];
for (int i = 0; i < o.size(); i++) sum += o[i];
cout << sum << '\n';
}
int main() {
int T = 1;
while (T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<unsigned long long int> vec(n);
unsigned long long int odd = 0, eve = 0;
for (int i = 0; i < n; i++) {
cin >> vec[i];
if (vec[i] % 2 == 0)
eve++;
else
odd++;
}
if (eve == odd + 1 || odd == eve + 1 || eve == odd) {
cout << 0 << endl;
return 0;
}
sort(vec.begin(), vec.end());
unsigned long long int cur = max(odd, eve) - min(odd, eve) - 1;
unsigned long long int sum = 0;
if (odd > eve) {
int sul = cur;
for (int i = 0; i < n; i++) {
if (sul == 0) break;
if (vec[i] % 2 == 1) {
sum += vec[i];
sul--;
}
}
} else {
int sul = cur;
for (int i = 0; i < n; i++) {
if (sul == 0) break;
if (vec[i] % 2 == 0) {
sum += vec[i];
sul--;
}
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(NULL);
;
long long int n, i, x;
cin >> n;
priority_queue<long long int> q, q1;
for (i = 0; i < n; i++) {
cin >> x;
if (x % 2)
q1.push(x);
else
q.push(x);
}
while (!q.empty() && !q1.empty()) {
q.pop();
q1.pop();
}
long long int mx1 = 0, mx2 = 0, sum = 0;
if (q.empty() && q1.empty()) {
cout << 0 << endl;
} else if (q.empty()) {
q1.pop();
while (!q1.empty()) {
sum += q1.top();
q1.pop();
}
cout << sum << endl;
} else if (q1.empty()) {
q.pop();
while (!q.empty()) {
sum += q.top();
q.pop();
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int compare(const void *a, const void *b) {
return *(int *)a < *(int *)b ? 1 : -1;
}
int main() {
int n, a[2100], od[2100], ev[2100], odd = 0, even = 0;
int i, j, k, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", a + i);
if (a[i] % 2 == 0)
even++;
else
odd++;
}
if (even == odd || even == odd + 1 || odd == even + 1) {
printf("0\n");
} else {
qsort(a, n, sizeof(int), compare);
j = 0, k = 0;
for (i = 0; i < n; ++i) {
if (a[i] % 2 == 0)
ev[j++] = a[i];
else
od[k++] = a[i];
}
if (odd > even) {
for (i = even + 1; i < odd; ++i) {
sum += od[i];
}
} else {
for (i = odd + 1; i < even; ++i) {
sum += ev[i];
}
}
printf("%d", sum);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long sum1 = 0, sum2 = 0;
long sum = 0;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] % 2 == 0)
sum1++;
else if (arr[i] % 2 != 0)
sum2++;
}
sort(arr.begin(), arr.end());
if (sum1 < sum2) {
for (int i = 0, j = 0; j < (abs(sum1 - sum2)) - 1; i++) {
if (arr[i] % 2 != 0) {
sum += arr[i];
j++;
}
}
} else if (sum1 > sum2) {
for (int i = 0, j = 0; j < (abs(sum1 - sum2)) - 1; i++) {
if (arr[i] % 2 == 0) {
sum += arr[i];
j++;
}
}
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, e = 0, d = 0;
cin >> n;
long long int ara[n];
for (long long int i = 0; i < n; i++) {
cin >> ara[i];
if (ara[i] % 2 == 0)
e++;
else
d++;
}
sort(ara, ara + n);
if (abs(e - d) == 1 || abs(e - d) == 0) {
cout << 0 << endl;
return 0;
}
long long int i = 0, sum = 0;
if (e < d) {
d -= (e + 1);
while (d) {
if (ara[i] % 2) {
sum += ara[i];
d--;
}
i++;
}
cout << sum << endl;
return 0;
}
if (e > d) {
e -= (d + 1);
while (e) {
if (ara[i] % 2 == 0) {
sum += ara[i];
e--;
}
i++;
}
cout << sum << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, num;
cin >> n;
vector<long long> o, e;
for (long long i = 0; i < n; i++) {
cin >> num;
if (num & 1)
o.push_back(num);
else
e.push_back(num);
}
if (o.size()) sort(o.begin(), o.end());
if (e.size()) sort(e.begin(), e.end());
long long oo = 0, ee = 0, idx, mi = 0;
if (o.size() > e.size()) {
idx = o.size() - e.size();
for (long long i = 0; i < idx - 1; i++) mi += o[i];
} else {
idx = e.size() - o.size();
for (long long i = 0; i < idx - 1; i++) mi += e[i];
}
cout << mi;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
vector<long long> even, odd;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
if (x % 2 == 0)
even.push_back(x);
else
odd.push_back(x);
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
if (even.size() > odd.size()) {
int x = even.size() - odd.size() - 1;
for (int i = 0; i < x; i++) ans = ans + even[i];
} else {
int x = odd.size() - even.size() - 1;
for (int i = 0; i < x; i++) ans = ans + odd[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> odds, evens;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, tmp;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp % 2)
odds.push_back(tmp);
else
evens.push_back(tmp);
}
int len = odds.size() - evens.size();
if (abs(len) < 1) {
cout << 0 << endl;
return 0;
}
sort(odds.begin(), odds.end());
sort(evens.begin(), evens.end());
long long ans = 0;
if (len > 0) {
for (int i = 0; i < len - 1; ++i) ans += odds[i];
} else {
for (int i = 0; i < len * (-1) - 1; ++i) ans += evens[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> odd, even;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x & 1)
odd.push_back(x);
else
even.push_back(x);
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
if (min(odd.size(), even.size()) + 1 == max(odd.size(), even.size()) or
even.size() == odd.size())
cout << "0" << endl;
else {
long long sum = 0;
if (even.size() == max(odd.size(), even.size())) {
for (int i = 0; i < max(odd.size(), even.size()) -
(min(odd.size(), even.size()) + 1);
i++)
sum += even[i];
} else {
for (int i = 0; i < max(odd.size(), even.size()) -
(min(odd.size(), even.size()) + 1);
i++)
sum += odd[i];
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
scanf("%d", &n);
int a[2005], sum1 = 0, sum2 = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] % 2 != 0) sum1++;
if (a[i] % 2 == 0) sum2++;
}
int c;
c = max(sum1, sum2) - min(sum1, sum2);
sort(a + 1, a + n + 1);
if (c == 0 || c == 1)
printf("0\n");
else {
int ans = 0;
if (sum1 < sum2) {
for (i = 1; i <= n; i++) {
if (a[i] % 2 == 0 && c > 1) {
c--;
ans = ans + a[i];
}
}
}
if (sum1 > sum2) {
for (i = 1; i <= n; i++) {
if (a[i] % 2 != 0 && c > 1) {
c--;
ans = ans + a[i];
}
}
}
printf("%d\n", ans);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int temp;
vector<int> ch;
vector<int> nec;
for (int i = 0; i < n; ++i) {
cin >> temp;
if (temp % 2 == 0) {
ch.push_back(temp);
} else {
nec.push_back(temp);
}
}
if (abs((int)ch.size() - (int)nec.size()) < 2) {
cout << 0;
} else {
if (ch.size() > nec.size()) {
sort(ch.begin(), ch.end());
int i = 0;
int ans = 0;
while (ch.size() - i - nec.size() > 1) {
ans += ch[i];
i++;
}
cout << ans;
} else {
sort(nec.begin(), nec.end());
int i = 0;
int ans = 0;
while (nec.size() - i - ch.size() > 1) {
ans += nec[i];
i++;
}
cout << ans;
}
}
}
|
#include <bits/stdc++.h>
const char endl = '\n';
int32_t main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
long long n, temp, O = 0, E = 0;
std::vector<long long> odds;
std::vector<long long> evens;
std::cin >> n;
for (long long i = 0; i < n; i++) {
std::cin >> temp;
if (temp % 2 == 1) {
odds.push_back(temp);
O++;
} else {
evens.push_back(temp);
E++;
}
}
std::sort(odds.begin(), odds.end());
std::sort(evens.begin(), evens.end());
long long diff = E - O;
long long ans = 0;
if (diff > 1) {
for (long long i = 0; i < diff - 1; i++) {
ans += evens[i];
}
}
if (diff < -1) {
diff *= -1;
for (long long i = 0; i < diff - 1; i++) {
ans += odds[i];
}
}
std::cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> odd, even;
int main() {
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
if (a & 1)
odd.push_back(a);
else
even.push_back(a);
}
sort(odd.rbegin(), odd.rend());
sort(even.rbegin(), even.rend());
int k = min(odd.size(), even.size());
sum -= accumulate(odd.begin(), odd.begin() + k, 0);
sum -= accumulate(even.begin(), even.begin() + k, 0);
if (k < odd.size()) sum -= odd[k];
if (k < even.size()) sum -= even[k];
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
int arr[N];
int arr2[N];
char a[N];
char matrix[100][100];
int main() {
int t;
cin >> t;
vector<int> v;
vector<int> x;
long long odd = 0;
long long even = 0;
long long sum = 0;
for (int i = 0; i < t; i++) {
cin >> arr[i];
if (arr[i] % 2 == 1) {
odd++;
v.push_back(arr[i]);
} else {
even++;
x.push_back(arr[i]);
}
}
sort(v.begin(), v.end());
sort(x.begin(), x.end());
if (even == odd)
cout << 0 << endl;
else {
if (odd > even) {
for (int i = 0; i < odd - even - 1; i++) {
sum += v[i];
}
} else {
for (int i = 0; i < even - odd - 1; i++) {
sum += x[i];
}
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, x, oi, ei, r, o[2200], e[2200];
int main() {
for (cin >> n; i < n; i++) cin >> x, x % 2 ? o[oi++] = x : e[ei++] = x;
sort(o, o + oi);
sort(e, e + ei);
if (oi > ei) swap(o, e), swap(oi, ei);
for (int i = 0; i < ei - oi - 1; i++) r += e[i];
cout << r;
}
|
#include <bits/stdc++.h>
using namespace std;
bool was[26];
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n + 1];
int t = 0, p = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x % 2 == 1) {
t++;
b[t] = x;
} else {
p++;
a[p] = x;
}
}
sort(a + 1, a + p + 1);
sort(b + 1, b + t + 1);
int ans = 0;
if (t >= p) {
for (int i = 1; i <= t - p - 1; i++) ans += b[i];
} else if (p > t) {
for (int i = 1; i <= p - t - 1; i++) ans += a[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, k;
cin >> n;
vector<long long> a(n);
long long eve = 0, odd = 0;
long long sum = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
eve++;
} else {
odd++;
}
sum += a[i];
}
sort(a.begin(), a.end());
if (eve == odd - 1 || odd == eve - 1 || odd == eve) {
cout << 0;
return 0;
}
if (eve == n || odd == n) {
cout << sum - a[n - 1];
return 0;
}
long long sum1 = 0;
if (eve > odd) {
long long xx = n - (odd + 1 + odd);
long long c = 0;
for (j = 0; j < n; j++) {
if (c == xx) {
break;
}
if (a[j] % 2 == 0) {
sum1 += a[j];
c++;
}
}
} else {
long long xx = n - (eve + eve + 1);
long long c = 0;
for (j = 0; j < n; j++) {
if (c == xx) {
break;
}
if (a[j] % 2 != 0) {
sum1 += a[j];
}
c++;
}
}
cout << sum1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
while (t--) {
int n;
cin >> n;
int sx = 0;
vector<int> v1, v2;
for (int i = 0; i < n; i++) {
int x = 0;
cin >> x;
sx = sx + x;
if (x % 2 == 0)
v2.push_back(x);
else
v1.push_back(x);
}
sort(v1.begin(), v1.end(), greater<int>());
sort(v2.begin(), v2.end(), greater<int>());
int n1 = v1.size();
int n2 = v2.size();
int sum = 0;
if (n1 == n2)
for (int i = 0; i < n1; i++) sum = sum + v1[i] + v2[i];
else {
if (n1 > n2) {
for (int i = 0; i < n2; i++) sum = sum + v1[i] + v2[i];
sum = sum + v1[n2];
} else {
for (int i = 0; i < n1; i++) sum = sum + v1[i] + v2[i];
sum = sum + v2[n1];
}
}
cout << sx - sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
long long ev = 0, od = 0;
vector<long long> odd, even;
sort(arr, arr + n);
for (long long i = 0; i < n; i++) {
if (arr[i] & 1) {
od++;
odd.push_back(arr[i]);
} else {
ev++;
even.push_back(arr[i]);
}
}
sort(odd.begin(), odd.end());
sort(even.begin(), even.end());
if (ev == od)
cout << 0 << endl;
else {
long long ans = 0, sum = 0;
if (od > ev) {
ans = n - (2 * ev + 1);
{
long long qw = odd.size();
for (long long i = 0; i < (qw - ev - 1); i++) sum += odd[i];
}
} else {
ans = n - (2 * od + 1);
{
for (long long i = 0; i < even.size() - (od + 1); i++) sum += even[i];
}
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> o, e;
int main() {
long long n, x, ans = 0;
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> x;
if (x % 2)
o.push_back(x);
else
e.push_back(x);
}
sort(o.begin(), o.end());
sort(e.begin(), e.end());
long long oz = o.size(), ez = e.size();
for (long long i = 0; i < (abs(oz - ez) - 1); i++) {
if ((oz - ez) >= 0)
ans += o[i];
else
ans += e[i];
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int odd[2005];
int even[2005];
bool cmp(int a, int b) { return a < b; }
using namespace std;
int main() {
int n, t, leno = 1, lene = 1;
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &t);
if (t & 1) {
even[lene] = t;
lene++;
} else {
odd[leno] = t;
leno++;
}
}
lene--;
leno--;
if (abs(lene - leno) == 1 || abs(lene - leno) == 0) {
printf("0");
return 0;
}
sort(odd + 1, odd + 1 + leno, cmp);
sort(even + 1, even + 1 + lene, cmp);
int sum = 0;
for (i = 1; i <= abs(leno - lene) - 1; i++) {
if (leno > lene)
sum += odd[i];
else
sum += even[i];
}
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
set<long long> st;
set<long long>::iterator it;
vector<long long> odd, even;
int main() {
long long test, t, i, j, k, a, b, c, x, y, z, n, m;
scanf("%lld", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &a);
if (a % 2) {
odd.push_back(a);
} else {
even.push_back(a);
}
}
x = odd.size();
y = even.size();
z = 0;
if (x > y + 1) {
a = x - y - 1;
sort(odd.begin(), odd.end());
for (i = 0; i < a; i++) {
z += odd[i];
}
} else if (y > x + 1) {
a = y - x - 1;
sort(even.begin(), even.end());
for (i = 0; i < a; i++) {
z += even[i];
}
}
cout << z << endl;
return 0;
}
|
#include <bits/stdc++.h>
const int MaxN = 2e3 + 10;
int n, od, ev;
int a[MaxN], odd[MaxN], even[MaxN];
int cmp(int a, int b) { return a > b; }
inline int solve1() {
int ret = 0;
int cnt = 1;
ret = odd[1];
while (cnt <= od && cnt <= ev) {
ret += odd[cnt + 1] + even[cnt];
++cnt;
}
return ret;
}
inline int solve2() {
int ret = 0;
int cnt = 1;
ret = even[1];
while (cnt <= od && cnt <= ev) {
ret += odd[cnt] + even[cnt + 1];
++cnt;
}
return ret;
}
int main() {
int sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), sum += a[i];
std::sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++) {
if (a[i] % 2)
odd[++od] = a[i];
else
even[++ev] = a[i];
}
int ans1 = solve1();
int ans2 = solve2();
printf("%d\n", sum - ((ans1 < ans2) ? ans2 : ans1));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5;
int n, a[mxN], k;
void solve() {
long long n;
cin >> n;
long long counto = 0, counte = 0;
vector<long long> arre, arro;
for (int i = 0; i < n; ++i) {
long long a;
cin >> a;
if (a % 2 == 0) {
arre.push_back(a);
counte += 1;
} else {
arro.push_back(a);
counto += 1;
}
}
sort(arre.begin(), arre.end());
sort(arro.begin(), arro.end());
long long diff = abs(counto - counte);
if (counte == counto || diff == 1) {
cout << 0 << endl;
return;
}
diff -= 1;
if (counte > counto) {
cout << accumulate(arre.begin(), arre.begin() + diff, 0);
return;
} else if (counte < counto) {
cout << accumulate(arro.begin(), arro.begin() + diff, 0);
return;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, ans, m, o, q;
int a[2010], b[2010];
cin >> n;
o = 0;
q = 0;
for (i = 1; i <= n; i++) {
cin >> m;
if (m % 2 == 0) {
a[o] = m;
o++;
} else {
b[q] = m;
q++;
}
}
ans = 0;
if ((o - q == 1) || (q - o == 1) || (o == q))
cout << "0" << endl;
else {
sort(a, a + o);
sort(b, b + q);
if (o > q) {
for (i = 0; i < o - q - 1; i++) ans = ans + a[i];
} else if (o < q) {
for (i = 0; i < q - o - 1; i++) ans = ans + b[i];
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int countSetBits(int n) {
unsigned int count = 0;
while (n) {
n &= (n - 1);
count++;
}
return count;
}
int powerOfTwo(int n) { return n && (!(n & (n - 1))); }
void solve() {
long long int n;
cin >> n;
vector<long long int> a(n);
for (long long int i = 0; i < n; i++) cin >> a[i];
sort(a.rbegin(), a.rend());
vector<long long int> o;
vector<long long int> e;
long long int even = 0;
long long int odd = 0;
for (long long int i = 0; i < n; i++) {
if (a[i] % 2 == 0) {
even++;
e.push_back(a[i]);
} else {
odd++;
o.push_back(a[i]);
}
}
long long int sum = 0;
if (even > odd) {
for (long long int i = odd + 1; i < even; i++) sum = sum + e[i];
} else if (odd > even) {
for (long long int i = even + 1; i < odd; i++) sum = sum + o[i];
}
cout << sum;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n];
long long int o[n];
long long int od = 0;
long long int sum = 0;
long long int e[n], ev = 0;
for (long long int i = 0; i < n; i++) {
o[i] = -1;
e[i] = -1;
}
for (long long int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
e[ev] = a[i];
ev++;
} else {
o[od] = a[i];
od++;
}
}
if (max(ev, od) - min(ev, od) == 1) {
cout << "0" << endl;
} else if (od == ev) {
cout << "0" << endl;
} else {
if (od > ev) {
long long int b = od - ev - 1;
sort(o, o + n);
long long int i = 0;
for (long long int j = 0; j < n; j++) {
if (i < b) {
if (o[j] > -1) {
sum = sum + o[j];
i++;
}
} else {
break;
}
}
cout << sum << endl;
} else {
long long int b = ev - od - 1;
sort(e, e + n);
long long int i = 0;
for (long long int j = 0; j < n; j++) {
if (i < b) {
if (e[j] > -1) {
sum = sum + e[j];
i++;
}
} else {
break;
}
}
cout << sum << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum;
cin >> n;
int arr[n + 5];
vector<int> od, ev;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] % 2 == 0)
od.push_back(arr[i]);
else
ev.push_back(arr[i]);
}
sort(od.begin(), od.end());
sort(ev.begin(), ev.end());
int os = od.size();
int es = ev.size();
if (os == es || abs(os - es) == 1) {
cout << 0 << endl;
} else {
sum = 0;
if (os > es) {
int x = os - es - 2;
for (int i = 0; i <= x; i++) {
sum = sum + od[i];
}
} else {
int x = es - os - 2;
for (int i = 0; i <= x; i++) {
sum = sum + ev[i];
}
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[2005];
int odd[2005], even[2005];
int cnt1 = 0, cnt2 = 0;
long long ans = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] & 1) {
cnt1++;
odd[cnt1] = a[i];
} else {
cnt2++;
even[cnt2] = a[i];
}
ans += a[i];
}
sort(odd + 1, odd + 1 + cnt1, greater<int>());
sort(even + 1, even + 1 + cnt2, greater<int>());
long long m = 0;
for (int i = 1;; i++) {
if (i & 1) {
if (i / 2 > cnt1) break;
m += odd[i / 2];
} else {
if (i / 2 > cnt2) break;
m += even[i / 2];
}
}
long long mm = 0;
for (int i = 1;; i++) {
if (i & 1) {
if (i / 2 > cnt2) break;
mm += even[i / 2];
} else {
if (i / 2 > cnt1) break;
mm += odd[i / 2];
}
}
ans = min(ans - m, ans - mm);
printf("%lld", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, a;
cin >> n;
vector<long> even, odd;
while (n--) {
cin >> a;
if (a % 2 == 0)
even.push_back(a);
else
odd.push_back(a);
}
sort(odd.begin(), odd.end());
sort(even.begin(), even.end());
reverse(odd.begin(), odd.end());
reverse(even.begin(), even.end());
int ol = (int)odd.size();
int el = (int)even.size();
int longer = ol > el ? ol : el;
int length = 0;
if (ol == el)
length = el;
else
length = ol > el ? el + 1 : ol + 1;
long res = 0;
vector<long> toiter = longer == ol ? odd : even;
for (int i = length; i < longer; i++) {
res += toiter[i];
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<long long> V(n);
for (int i = 0; i < n; ++i) cin >> V[i];
vector<long long> odd, even;
sort(V.begin(), V.end(), greater<int>());
long long total = 0;
for (int i = 0; i < n; ++i) {
if (V[i] % 2)
odd.push_back(V[i]);
else
even.push_back(V[i]);
total += V[i];
}
int turn = odd.size() > even.size(), a = 0, b = 0;
while (true) {
if (turn) {
if (a >= odd.size()) break;
total -= odd[a];
a++;
} else {
if (b >= even.size()) break;
total -= even[b];
b++;
}
turn = !turn;
}
cout << total << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> even;
vector<long long> odd;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t % 2 == 0)
even.push_back(t);
else
odd.push_back(t);
}
sort(even.begin(), even.end(), greater<long long>());
sort(odd.begin(), odd.end(), greater<long long>());
int at_least = min(even.size(), odd.size());
int res = 0;
if (even.size() > odd.size()) {
for (int i = even.size() - 1; i > at_least; i--) {
res += even[i];
}
} else if (even.size() < odd.size()) {
for (int i = odd.size() - 1; i > at_least; i--) {
res += odd[i];
}
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void PRE() {
cout << fixed << showpoint;
cout << setprecision(9);
}
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
long long n, i = 0;
cin >> n;
vector<long long> o, e;
for (i = 0; i < n; ++i) {
long long a;
cin >> a;
if (a % 2 == 0)
e.push_back(a);
else
o.push_back(a);
}
long long sum;
sort(o.begin(), o.end());
sort(e.begin(), e.end());
if (o.size() > e.size()) {
long long nn = o.size() - e.size();
sum = 0;
for (i = 0; i < nn - 1; ++i) {
sum += o[i];
}
} else {
long long nn = e.size() - o.size();
sum = 0;
for (i = 0; i < nn - 1; ++i) {
sum += e[i];
}
}
cout << sum << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n), k(n);
int odd = 0, even = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] % 2 == 0)
even++;
else
odd++;
}
if (even - odd == 0 || abs(even - odd) == 1) {
cout << 0;
return 0;
}
int dif = even - odd, ans = 0;
sort(v.begin(), v.end());
if (dif > 0) {
dif = abs(dif);
for (int i = 0; i < n && dif != 1; i++)
if (v[i] % 2 == 0) dif--, ans += v[i];
} else {
dif = abs(dif);
for (int i = 0; i < n && dif != 1; i++)
if (v[i] % 2 != 0) dif--, ans += v[i];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> e, o;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x % 2)
o.push_back(x);
else
e.push_back(x);
}
long long ans = 0;
if (abs((int)(o.size() - e.size())) > 1) {
if (o.size() < e.size()) {
sort(e.rbegin(), e.rend());
for (int i = o.size() + 1; i < e.size(); ++i) {
ans += e[i];
}
} else {
sort(o.rbegin(), o.rend());
for (int i = e.size() + 1; i < o.size(); ++i) {
ans += o[i];
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, sum = 0;
int j[2005], o[2005];
int sj = 0, so = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x % 2 == 0)
o[so++] = x;
else
j[sj++] = x;
}
if (abs(sj - so) < 2) {
cout << 0 << endl;
} else if (sj > so) {
x = sj - so - 1;
sort(j, j + sj);
for (int i = 0; i < x; i++) sum += j[i];
cout << sum << endl;
} else if (sj < so) {
x = so - sj - 1;
sort(o, o + so);
for (int i = 0; i < x; i++) sum += o[i];
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, od = 0, ev = 0;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0)
ev++;
else
od++;
}
if (od == ev || od == ev - 1 || ev == od - 1)
cout << 0;
else {
int p, co = 0;
sort(a.begin(), a.end());
if (od > ev)
p = 1;
else
p = 0;
long int sum = 0;
int dif = abs(od - ev) - 1;
for (i = 0; i < n; i++) {
if (a[i] % 2 == p) {
sum += a[i];
co++;
if (co == dif) break;
}
}
cout << sum;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int A[10000], B[10000];
int i, n, x, x1, x2;
long long sum;
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (x % 2 == 0)
A[x1++] = x;
else
B[x2++] = x;
}
sort(A, A + x1);
sort(B, B + x2);
if (x1 > x2) {
x2 = x1 - x2 - 1;
for (i = 0; i < x2; i++) sum += A[i];
} else {
x2 = x2 - x1 - 1;
for (i = 0; i < x2; i++) sum += B[i];
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n + 5], od = 0, ev = 0, x = 0, y = 0, o[n + 4], e[n + 4], sm = 0,
i;
for (i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] % 2 == 0) {
e[x++] = a[i];
ev++;
} else {
o[y++] = a[i];
od++;
}
}
sort(e, e + x, greater<long long>());
sort(o, o + y, greater<long long>());
if (abs(od - ev) <= 1) {
cout << "0";
return 0;
}
long long k = min(od, ev);
if (od > ev) {
for (i = k + 1; i < y; ++i) {
sm += o[i];
}
} else {
for (i = k + 1; i < x; ++i) {
sm += e[i];
}
}
cout << sm;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7, N = 1e5 + 5;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
long long a[n + 5], ans = 0, maxx = 0, sum = 0;
vector<long long> e, o;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] & 1)
e.push_back(a[i]);
else
o.push_back(a[i]);
maxx = max(a[i], maxx);
sum += a[i];
}
sort(e.begin(), e.end()), sort(o.begin(), o.end());
long long es = (long long)e.size(), os = (long long)o.size();
if (abs(es - os) <= 1) {
cout << 0;
return 0;
}
if (es == 0 || os == 0) {
cout << sum - maxx;
return 0;
}
if (es > os) {
for (int i = 0; i < (es - os - 1); i++) {
ans += e[i];
}
} else {
for (int i = 0; i < (os - es - 1); i++) {
ans += o[i];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j;
cin >> n;
long long a[n], b[n], c[n], e = 0, o = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
b[e] = a[i];
++e;
} else {
c[o] = a[i];
++o;
}
}
sort(b, b + e);
sort(c, c + o);
long long f;
if (e > o)
f = o;
else
f = e;
long long sum = 0;
if (e > o) {
for (i = e - o - 2; i >= 0; i--) sum += b[i];
} else {
for (i = o - e - 2; i >= 0; i--) sum += c[i];
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v1, v2;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long total;
cin >> total;
for (long long i = 1; i <= total; i++) {
long long val;
cin >> val;
if (val % 2 == 0)
v1.push_back(val);
else
v2.push_back(val);
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
long long temp = (long long)v1.size() - (long long)v2.size();
temp = abs(temp);
if (temp <= 1) {
cout << 0 << endl;
} else {
long long sum = 0;
if (v1.size() > v2.size()) {
for (long long i = 0; i < temp - 1; i++) {
sum += v1[i];
}
} else {
for (long long i = 0; i < temp - 1; i++) {
sum += v2[i];
}
}
cout << sum << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> even, odd;
long long i, j, k, x;
for (i = 0; i < n; i++) {
cin >> x;
if (x % 2 == 0)
even.push_back(x);
else
odd.push_back(x);
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
long long s = min(even.size(), odd.size());
long long ans = 0;
if (s < even.size()) {
for (i = 0; i < even.size() - s - 1; i++) ans += even[i];
} else {
for (i = 0; i < odd.size() - s - 1; i++) ans += odd[i];
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int inf = 1000 * 1000 * 1000;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
long long n, t, zuyg = 0, kent = 0, ans = 0, qan = 0;
cin >> n;
vector<long long> a;
for (int i = 0; i < n; i++) {
cin >> t;
a.push_back(t);
if (t % 2 == 0) {
zuyg++;
continue;
}
kent++;
}
sort(a.begin(), a.end());
if (abs(kent - zuyg) == 1 || zuyg == kent) {
cout << 0 << endl;
return 0;
}
if (kent < zuyg) {
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 0) {
ans += a[i];
qan++;
}
if (qan == zuyg - kent - 1) {
break;
}
}
cout << ans << endl;
}
if (zuyg < kent) {
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 1) {
ans += a[i];
qan++;
}
if (qan == kent - zuyg - 1) {
break;
}
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long accumulate(vector<int>::iterator first, vector<int>::iterator last) {
long long ret = 0;
while (first != last) {
ret += *first;
first++;
}
return ret;
}
int main() {
int n, x;
vector<int> odd, even;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
x % 2 == 0 ? even.push_back(x) : odd.push_back(x);
}
if (abs((int)even.size() - (int)odd.size()) < 2) {
printf("0\n");
return 0;
}
sort(even.begin(), even.end(), greater<int>());
sort(odd.begin(), odd.end(), greater<int>());
long long sum = 0;
if (even.size() > odd.size())
sum = accumulate(even.begin() + odd.size() + 1, even.end());
else
sum = accumulate(odd.begin() + even.size() + 1, odd.end());
printf("%lld\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int even[2000];
int odd[2000];
int evenCnt;
int oddCnt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x & 1) {
odd[oddCnt++] = x;
} else {
even[evenCnt++] = x;
}
}
sort(odd, odd + oddCnt);
sort(even, even + evenCnt);
int k = max(oddCnt, evenCnt);
int sum = 0;
if (k == oddCnt) {
for (int i = 0; i < oddCnt - evenCnt - 1; ++i) {
sum += odd[i];
}
} else {
for (int i = 0; i < evenCnt - oddCnt - 1; ++i) {
sum += even[i];
}
}
cout << sum << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int minimum = 2147483647;
bool cmp(int a, int b) { return a > b; }
void dfs(vector<int> v, bool flag) {
if (v.size() == 0 || minimum == 0) {
minimum = 0;
return;
}
for (int i = 0; i < v.size(); i++) {
if (flag == true) {
if (v[i] % 2 == 0) {
v.erase(v.begin() + i);
dfs(v, false);
return;
}
} else {
if (v[i] % 2 == 1) {
v.erase(v.begin() + i);
dfs(v, true);
return;
}
}
}
int sum = 0;
for (int i = 0; i < v.size(); i++) {
sum += v[i];
}
minimum = min(minimum, sum);
}
int main() {
std::ios::sync_with_stdio(false), cin.tie(0);
int n;
int inp;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> inp;
v.push_back(inp);
}
sort(v.begin(), v.end(), cmp);
dfs(v, true);
dfs(v, false);
cout << minimum << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed;
cout.precision(10);
;
int n;
cin >> n;
vector<long long> even, odd;
long long se = 0ll, so = 0ll, co = 0, ce = 0;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
if (a & 1) {
odd.push_back(a);
so += a;
co++;
} else
even.push_back(a), se += 1, ce++;
}
if (abs(co - ce) < 2) {
cout << 0;
return 0;
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
long long ans = 0ll;
if (co > ce) {
int diff = co - ce - 1;
for (long long i = 0; i < diff; i++) ans += odd[i];
} else {
int diff = ce - co - 1;
for (long long i = 0; i < diff; i++) ans += even[i];
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v2, v3, v4, v5;
int main() {
long long int N, i, sum = 0;
cin >> N;
long long int a[N];
for (i = 0; i < N; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
v2.push_back(a[i]);
v4.push_back(a[i]);
} else {
v3.push_back(a[i]);
v5.push_back(a[i]);
}
}
sort(v2.begin(), v2.end());
sort(v3.begin(), v3.end());
if (v2.size() == v3.size())
cout << "0" << endl;
else if (v2.size() > v3.size()) {
for (i = 0; i < v2.size() - (v3.size() + 1); i++) {
sum += v2[i];
}
cout << sum << endl;
} else {
for (i = 0; i < v3.size() - (v2.size() + 1); i++) {
sum += v3[i];
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int sum = 0, sum1 = 0, sum2 = 0;
vector<long long int> a(n), b, c;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0)
b.push_back(a[i]);
else
c.push_back(a[i]);
sum += a[i];
}
sort(b.begin(), b.end(), greater<int>());
sort(c.begin(), c.end(), greater<int>());
long long int i = 0, j = 0, k = 1;
sum1 = sum;
while (true) {
if (k and i < b.size()) {
sum1 -= b[i];
i++;
} else if (!k and j < c.size()) {
sum1 -= c[j];
j++;
} else
break;
k = 1 - k;
}
i = 0, j = 0, k = 0;
sum2 = sum;
while (true) {
if (k and i < b.size()) {
sum2 -= b[i];
i++;
} else if (!k and j < c.size()) {
sum2 -= c[j];
j++;
} else
break;
k = 1 - k;
}
cout << min(sum2, sum1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
vector<int> odd;
vector<int> even;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] & 1)
odd.push_back(arr[i]);
else
even.push_back(arr[i]);
}
sort(odd.rbegin(), odd.rend());
sort(even.rbegin(), even.rend());
int v = min(odd.size(), even.size());
if (v + 1 >= max(odd.size(), even.size())) {
cout << 0;
return 0;
}
v++;
int sum = 0;
for (int i = 0; i < odd.size(); i++) {
if (i < v) continue;
sum += odd[i];
}
for (int i = 0; i < even.size(); i++) {
if (i < v) continue;
sum += even[i];
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[1000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n];
int odd = 0, even = 0;
vector<int> O, E;
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] % 2 == 0) {
E.push_back(arr[i]);
even++;
} else {
O.push_back(arr[i]);
odd++;
}
}
int inter = min(odd, even);
sort(O.begin(), O.end());
sort(E.begin(), E.end());
odd -= inter;
even -= inter;
if (odd > even) odd--;
if (even > odd) even--;
long long ans = 0;
for (auto a : O) {
if (odd == 0) break;
ans += a;
odd--;
}
for (auto a : E) {
if (even == 0) break;
ans += a;
even--;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, a[2005], ji = 0, o = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
a[i] = x;
if (x & 1)
ji++;
else
o++;
}
if (abs(ji - o) <= 1)
cout << 0;
else {
if (ji < o) {
int t = o - ji - 1, sum = 0, cou = 0;
sort(a, a + n);
for (int i = 0; cou < t; ++i)
if (!(a[i] & 1)) sum += a[i], cou++;
cout << sum;
} else {
int t = ji - o - 1, sum = 0, cou = 0;
sort(a, a + n);
for (int i = 0; cou < t; ++i)
if (a[i] & 1) sum += a[i], cou++;
cout << sum;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
long long int p[N], c[N];
vector<long long int> odd1, eve1, odd2, eve2;
set<long long int> st;
long long int a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n, source;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2) {
odd1.push_back(a[i]);
odd2.push_back(a[i]);
} else {
eve1.push_back(a[i]);
eve2.push_back(a[i]);
}
}
sort(odd1.begin(), odd1.end());
sort(odd2.begin(), odd2.end());
sort(eve1.begin(), eve1.end());
sort(eve2.begin(), eve2.end());
long long int cnt = 0;
long long int flag = 1;
while (1) {
if (odd1.size() > 0 && flag == 1) {
odd1.pop_back();
flag = 0;
} else
break;
if (eve1.size() > 0 && flag == 0) {
eve1.pop_back();
flag = 1;
} else
break;
}
flag = 1;
while (1) {
if (eve2.size() > 0 && flag == 1) {
eve2.pop_back();
flag = 0;
} else
break;
if (odd2.size() > 0 && flag == 0) {
odd2.pop_back();
flag = 1;
} else
break;
}
long long int ans1 = 0, ans2 = 0;
if (odd1.size()) {
for (auto i : odd1) ans1 += i;
}
if (eve1.size()) {
for (auto i : eve1) ans1 += i;
}
if (odd2.size()) {
for (auto i : odd2) ans2 += i;
}
if (eve2.size()) {
for (auto i : eve2) ans2 += i;
}
cout << min(ans1, ans2);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, p = 0, q = 0;
cin >> n;
long long int a[n], e[n], o[n];
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0) {
e[p] = a[i];
p++;
} else {
o[q] = a[i];
q++;
}
}
sort(e, e + p);
sort(o, o + q);
long long int sum = 0;
if (abs(p - q) <= 1) {
cout << "0";
} else if (p > q) {
k = p - q - 1;
for (j = 0; j < k; j++) {
sum = sum + e[j];
}
cout << sum;
} else {
k = q - p - 1;
for (j = 0; j < k; j++) {
sum = sum + o[j];
}
cout << sum;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
vector<int> odd, eve;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x & 1)
odd.push_back(x);
else
eve.push_back(x);
}
sort(odd.begin(), odd.end(), greater<int>());
sort(eve.begin(), eve.end(), greater<int>());
int os = odd.size();
int es = eve.size();
int mx = min(es, os);
int rem = mx + 1;
long long sum = 0;
if (es > os) {
for (int i = rem; i < es; i++) sum += eve[i];
} else {
for (int i = rem; i < os; i++) sum += odd[i];
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long int> even, odd;
long long int temp;
long long int total_sum = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
if (temp % 2 == 0)
even.push_back(temp);
else
odd.push_back(temp);
total_sum += temp;
}
long long int sum = 0;
sort(even.rbegin(), even.rend());
sort(odd.rbegin(), odd.rend());
long long int i = 0;
for (i = 0; i < min(even.size(), odd.size()); i++) {
sum += even[i] + odd[i];
}
long long int ans;
if (even.size() > odd.size())
ans = total_sum - (sum + even[i]);
else
ans = total_sum - (sum + odd[i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int len = 1e4 + 10;
const double pi = acos(-1.0);
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
multiset<int> se[2];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
int t;
cin >> t;
se[t % 2].insert(t);
}
int ans = 0;
if (se[0].size() > se[1].size()) {
int x = se[0].size() - se[1].size() - 1;
while (x--) {
ans += *se[0].begin();
se[0].erase(se[0].begin());
}
} else if (se[0].size() < se[1].size()) {
int x = se[1].size() - se[0].size() - 1;
while (x--) {
ans += *se[1].begin();
se[1].erase(se[1].begin());
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, i, j, k, b[200005], a[200005], x, m, l, r, mid, ans, s;
vector<long long> u, v;
int main() {
ios::sync_with_stdio(NULL);
cin.tie(0);
cout.tie(0);
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (x % 2)
v.push_back(x);
else
u.push_back(x);
s += x;
}
sort(u.begin(), u.end(), greater<long long>());
sort(v.begin(), v.end(), greater<long long>());
n = v.size();
m = u.size();
n = min(n, m);
for (i = 0; i < n; i++) s -= u[i] + v[i];
if (u.size() > v.size()) s -= u[i];
if (u.size() < v.size()) s -= v[i];
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
int make_positive(int a) { return a > 0 ? a : a * -1; }
int main(void) {
int number;
int temp;
scanf("%d", &number);
vector<int> even;
vector<int> odd;
for (int i = 0; i < number; i++) {
scanf("%d", &temp);
if (!(temp % 2)) {
even.push_back(temp);
} else {
odd.push_back(temp);
}
}
if (even.size() == odd.size() ||
(even.size() - 1 == odd.size() || odd.size() - 1 == even.size())) {
printf("0\n");
return 0;
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
int limit = make_positive(even.size() - odd.size()) - 1;
long long sum = 0;
for (int i = 0; i < limit; i++) {
if (even.size() > odd.size()) {
sum += even[i];
} else {
sum += odd[i];
}
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n];
long long int sum = 0;
int ev = 0, od = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] % 2 == 0)
ev++;
else
od++;
}
if (od == 0 || ev == 0) {
std::sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
cout << sum;
return 0;
}
if (n % 2 == 0 && ev == n / 2) {
cout << "0";
return 0;
} else if (n % 2 != 0 &&
(ev > od && ev - od == 1 || od > ev && od - ev == 1)) {
cout << "0";
return 0;
} else {
std::sort(a, a + n);
int dif = 0;
if (ev > od) {
int dif = ev - od;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 2 == 0 && cnt < dif - 1) {
sum += a[i];
cnt++;
}
}
} else {
int dif = od - ev;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] % 2 != 0 && cnt < dif - 1) {
sum += a[i];
cnt++;
}
}
}
cout << sum << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> arr_even;
vector<int> arr_odd;
int even = 0, odd = 0;
long long int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] % 2 == 0) {
even++;
arr_even.push_back(a[i]);
} else {
odd++;
arr_odd.push_back(a[i]);
}
}
int diff = abs(even - odd);
sort(arr_even.begin(), arr_even.end());
sort(arr_odd.begin(), arr_odd.end());
if (diff > 1) {
if (even > odd) {
for (int i = 0; i < diff - 1; ++i) sum += arr_even[i];
} else if (odd > even) {
for (int i = 0; i < diff - 1; ++i) sum += arr_odd[i];
} else
sum = 0;
} else
sum = 0;
cout << sum << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, o = 1, e = 1;
long long sum = 0;
int odd[2005], even[2005];
memset(odd, 0, sizeof(odd));
memset(even, 0, sizeof(even));
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x % 2 == 0) {
odd[o++] = x;
} else {
even[e++] = x;
}
}
if (o == e || (abs(o - e)) == 1) {
cout << 0 << endl;
return 0;
}
sort(odd + 1, odd + o);
sort(even + 1, even + e);
if (o > e) {
for (int i = 1; i <= o - e - 1; i++) sum += odd[i];
} else {
for (int i = 1; i <= e - o - 1; i++) sum += even[i];
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long odd = 0, even = 0;
long long a[30000];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] & 1)
odd++;
else
even++;
}
sort(a, a + n);
int diff = abs(even - odd);
if (diff <= 1)
cout << "0" << endl;
else {
long long sum = 0;
diff--;
bool want = false;
if (even > odd) want = true;
for (int i = 0; i < n; i++) {
if (diff > 0) {
if (want) {
if (a[i] % 2 == 0) sum += a[i], diff--;
} else {
if (a[i] & 1) sum += a[i], diff--;
}
}
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> even;
vector<long long int> odd;
long long int c;
for (int i = 0; i < n; i++) {
cin >> c;
if (c % 2 == 0) {
even.push_back(c);
} else {
odd.push_back(c);
}
}
long long int sm = 0;
if (even.size() <= odd.size()) {
int l = odd.size() - even.size() - 1;
sort(odd.begin(), odd.end());
for (int i = 0; i < l; i++) {
sm = sm + odd[i];
}
} else {
int l = even.size() - odd.size() - 1;
sort(even.begin(), even.end());
for (int i = 0; i < l; i++) {
sm = sm + even[i];
}
}
cout << sm;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n;
vector<int> a;
vector<int> b;
for (int i = 0; i < n; i++) {
cin >> x;
if (x % 2 == 0)
a.push_back(x);
else
b.push_back(x);
}
if (a.size() == b.size() || a.size() == b.size() + 1 ||
a.size() + 1 == b.size()) {
cout << 0 << endl;
} else {
long long sum = 0;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
if (a.size() > b.size()) {
for (int i = 0; i < a.size() - b.size() - 1; i++) sum += a[i];
cout << sum << endl;
} else {
for (int i = 0; i < b.size() - a.size() - 1; i++) sum += b[i];
cout << sum << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<long long int> even;
vector<long long int> odd;
for (int i = 0; i < n; ++i) {
long long int temp;
cin >> temp;
if (temp % 2 == 0) {
even.push_back(temp);
} else {
odd.push_back(temp);
}
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end());
long long int ans = 0;
if (even.size() == 0) {
for (int i = 0; i < odd.size() - 1; ++i) {
ans += odd[i];
}
} else if (odd.size() == 0) {
for (int i = 0; i < even.size() - 1; ++i) {
ans += even[i];
}
} else if (even.size() > odd.size()) {
for (int i = 0; i < even.size() - odd.size() - 1; ++i) {
ans += even[i];
}
} else if (odd.size() > even.size()) {
for (int i = 0; i < odd.size() - even.size() - 1; ++i) {
ans += odd[i];
}
} else
ans = 0;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int n;
cin >> n;
vector<vector<int>> aa(2, vector<int>());
int64_t sm = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
aa[a % 2].push_back(a);
sm += a;
}
sort(aa[0].begin(), aa[0].end());
sort(aa[1].begin(), aa[1].end());
int64_t res = sm;
int i, j;
i = aa[0].size() - 1;
j = aa[1].size() - 1;
while (i >= 0 && j >= 0) {
res -= aa[0][i--];
res -= aa[1][j--];
}
if (i >= 0) res -= aa[0][i--];
if (j >= 0) res -= aa[1][j--];
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
long long ara[2005], n, sum, jur, bejur;
vector<int> even, odd;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ara[i];
if (ara[i] & 1) {
odd.push_back(ara[i]);
bejur++;
} else {
even.push_back(ara[i]);
jur++;
}
sum += ara[i];
}
if (jur == bejur) {
cout << "0\n";
exit(0);
}
if (abs(jur - bejur) == 1) {
cout << "0\n";
exit(0);
}
long long mn = min(jur, bejur);
if (odd.size() > 0) sort(odd.rbegin(), odd.rend());
if (even.size() > 0) sort(even.rbegin(), even.rend());
if (mn > 0) {
for (int i = 0; i < mn; i++) {
sum -= odd[i];
sum -= even[i];
}
if (odd[mn] > even[mn]) {
sum -= odd[mn];
} else {
sum -= even[mn];
}
} else {
if (jur > bejur) {
sum -= even[0];
} else {
sum -= odd[0];
}
}
cout << sum << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2020;
long long Try(vector<long long>& v1, vector<long long>& v2);
long long a[N];
vector<long long> v[2];
int main() {
long long n;
cin >> n;
for (long long i = 1; i <= n; i++)
scanf("%I64d", a + i), v[a[i] & 1].push_back(a[i]);
for (long long k : {0, 1}) sort(v[k].begin(), v[k].end());
cout << min(Try(v[0], v[1]), Try(v[1], v[0]));
}
long long Try(vector<long long>& v1, vector<long long>& v2) {
long long Turn = 1;
while (true) {
vector<long long>& v3 = Turn ? v1 : v2;
if (v3.empty()) break;
v3.pop_back();
Turn = !Turn;
}
long long Sum = 0;
for (auto x : v1) Sum += x;
for (auto x : v2) Sum += x;
return Sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v1, v2;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
if (h % 2)
v1.push_back(h);
else
v2.push_back(h);
}
int p1 = v1.size(), p2 = v2.size();
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
int i, j;
if (p1 == p2) {
i = 0;
j = 0;
} else if (p1 < p2) {
i = 0;
j = p2 - p1 - 1;
} else {
i = p1 - p2 - 1;
j = 0;
}
long long res = 0;
for (int k = 0; k < i; k++) res += v1[k];
for (int k = 0; k < j; k++) res += v2[k];
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
long long n, a[1 << 18], sum;
vector<long long> v1, v2;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
sum += a[i];
if (a[i] % 2 == 0)
v1.push_back(a[i]);
else
v2.push_back(a[i]);
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
int c1 = v1.size() - 1, c2 = v2.size() - 1, ty = 0;
if (v1.size() < v2.size()) ty = 1;
while (true) {
if (ty == 0) {
if (c1 < 0) break;
sum -= v1[c1];
c1--;
}
if (ty == 1) {
if (c2 < 0) break;
sum -= v2[c2];
c2--;
}
ty ^= 1;
}
printf("%lld\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, y, x, sum = 0;
string str;
cin >> n >> x >> y >> str;
int len = str.size() - 1;
for (int i = len; i > len - x; i--) {
if (str[i] == '1') sum++;
}
if (str[len - y] == '0')
sum++;
else
sum--;
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, k = 0;
cin >> n >> x >> y;
string a;
cin >> a;
if (n == 0) {
cout << 0;
return 0;
}
string b = "";
for (int i = a.size() - x; i < a.size(); i++) {
b += a[i];
}
reverse(b.begin(), b.end());
for (int i = 0; i < b.size(); i++) {
if (b[i] == '1' && i != y) k++;
if (b[i] == '0' && i == y) k++;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
int ans = 0;
for (int i = n - 1; i >= n - x; --i) {
if (i == n - y - 1 || i == n - x - 1) {
if (s[i] != '1') ++ans;
} else if (s[i] == '1') {
++ans;
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9;
const long long mod = 100000000;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
int c = 0, i = 0;
for (; i < y; ++i) {
if (s[n - i - 1] == '0') continue;
c++;
}
if (s[n - i - 1] == '0') c++;
++i;
for (; i < x; ++i) {
if (s[n - i - 1] == '0') continue;
c++;
}
cout << c;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, ans = 0;
string s;
cin >> n >> x >> y >> s;
for (int i = (int)s.size() - 1, j = 0; j < x; --i, ++j) {
if (j != y && s[i] == '1') ++ans;
if (j == y && s[i] == '0') ++ans;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s1[54545454];
int main() {
long long int a, c, b, test, n, x, y, k, i, j;
cin >> n >> x >> y;
getchar();
cin >> s1;
long long int index = 0;
a = strlen(s1);
for (i = 0; i < a; i++) {
if (s1[i] == '1') {
if (i + x > a - 1) break;
index = i;
}
}
c = 0;
b = 0;
for (i = index + 1; i < a; i++) {
if (s1[i] == '1') c++;
if (s1[n - y - 1] == '1') b = 1;
}
if (c == 0)
cout << 1 << endl;
else if (b == 1) {
cout << (c - 1) << endl;
} else
cout << c + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
char s[200001], t1[200001];
long long n, x, y, t, con = 0;
cin >> n >> x >> y;
getchar();
gets(s);
t = n - x;
for (long long i = t; s[i] != '\0'; i++) {
if (i == n - 1 - y && s[i] != '1') con++;
if (i != n - 1 - y && s[i] != '0') con++;
}
cout << con << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const long long INF = 1e9 + 47;
const long long LINF = INF * INF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
int ans = 0;
reverse(s.begin(), s.end());
s.resize(x);
for (int i = (0); i < (x); ++i) {
if (i == y)
ans += s[i] == '0';
else
ans += s[i] == '1';
}
cout << ans << endl;
cerr << "Time elapsed: " << clock() / (double)CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
long long int n, x, y;
cin >> n >> x >> y;
string a;
cin >> a;
long long int c = 0;
for (long long int i = 0; i < x; i++) {
if (a[n - i - 1] == '0' && i == (y))
c++;
else if (a[n - i - 1] == '1' && i != (y))
c++;
}
cout << c;
}
|
#include <bits/stdc++.h>
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
reverse(s.begin(), s.end());
int ans = 0;
for (int i = 0; i < y; i++) {
if (s[i] == '1') ans++;
}
if (s[y] == '0') ans++;
for (int i = y + 1; i < x; i++) {
if (s[i] == '1') ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, x, y;
cin >> n >> x >> y;
string num;
cin >> num;
long long ans = 0;
for (int i = n - x; i < n; i++) {
if (i == n - 1 - y && num[i] == '0')
ans++;
else if (i != n - 1 - y && num[i] == '1')
ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int k;
int main() {
int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
int p = n - x;
int d = 0;
for (int i = p; i < n; i++) {
if (i == n - y - 1)
d += s[i] != '1';
else
d += s[i] != '0';
}
cout << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int n, x, y;
cin >> n >> x >> y;
string second;
cin >> second;
reverse(second.begin(), second.end());
long long int ans = 0;
for (long long int i = 0; i < x; i++) {
if (i == y) {
if (second[i] != '1') ans++;
continue;
}
if (second[i] == '1') ans++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y;
char a;
cin >> n >> x >> y;
y++;
int count = 0;
for (int i = 1; i <= n - x; i++) {
cin >> a;
}
for (int i = n - x + 1; i < n - y + 1; i++) {
cin >> a;
if (a == '1') count++;
}
cin >> a;
if (a == '0') count++;
for (int i = n - y + 2; i <= n; i++) {
cin >> a;
if (a == '1') count++;
}
cout << count;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
char ss[maxn];
int MIN(int x, int y) { return x < y ? x : y; }
int main(void) {
int n, x, y, cnt = 0;
scanf("%d%d%d", &n, &x, &y);
scanf("%s", ss + 1);
for (int i = 1; i <= x; i++) {
char ch = (i == y + 1 ? '1' : '0');
if (ch != ss[n - i + 1]) cnt++;
}
printf("%d\n", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x, y;
cin >> n >> x >> y;
string s;
cin >> s;
string temp1, temp2;
long long int i = n - x;
for (i; i < n; i++) {
temp1 += s[i];
}
long long int ans = 0;
for (i = 0; i < x; i++) {
if (i == x - y - 1 && temp1[i] == '1') {
continue;
} else if (i == x - y - 1 && temp1[i] == '0')
ans++;
else if (temp1[i] == '1')
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1.5e7 + 10;
const double eps = (double)1e-8;
const double PI = acos(-1.0);
inline bool eq(double a, double b) { return abs(b - a) < eps; }
inline double getdouble() {
double x;
scanf("%lf", &x);
return x;
}
inline int getint() {
int x;
scanf("%d", &x);
return x;
}
inline long long getlonglong() {
long long x;
scanf("%lld", &x);
return x;
}
inline unsigned long long getunsignedlonglong() {
unsigned long long x;
scanf("%llu", &x);
return x;
}
int main() {
int n = getint(), x = getint(), y = getint();
string s;
cin >> s;
if (y == 0) {
int p = 0, idx = n - 1;
if (s[idx] == '0') p++;
x -= y + 1;
while (x--) {
if (s[idx - 1] == '1') p++;
idx--;
}
cout << p << endl;
return 0;
}
int id = n - y - 1, cnt = 0;
if (s[id] == '0') cnt++;
x -= y + 1;
int idd = id;
while (x--) {
if (s[idd - 1] == '1') cnt++;
idd--;
}
for (int i = id + 1; i < n; i++) {
if (s[i] == '1') cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
long long max(long long A, long long b) {
if (A > b) return A;
return b;
}
long long min(long long A, long long b) {
if (A < b) return A;
return b;
}
using namespace std;
int main() {
long long n, x, y;
cin >> n >> x >> y;
string str;
cin >> str;
string last = "";
for (int i = n - x; i < n; i++) last += str[i];
long long ans = 0;
for (int i = last.length() - 1; i >= 0; i--) {
if (i == x - y - 1 && last[i] != '1') {
ans++;
} else if (i != x - y - 1 && last[i] != '0')
ans++;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
int main() {
int n, x, y, i, j, c = 0, d;
scanf("%d%d%d", &n, &x, &y);
char str[n];
scanf("%s", str);
for (i = n - 1; i > n - 1 - x; i--) {
if (str[i] == '0' && i == (n - 1 - y)) {
c++;
} else if (str[i] == '1' && i != (n - 1 - y))
c++;
}
printf("%d", c);
}
|
#include <bits/stdc++.h>
const int M = 1e6;
int main() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
getchar();
char a[M];
int sum = 0;
scanf("%s", a);
for (int i = n - m; i < n; i++) {
if (i == (n - k - 1)) {
if (a[i] == '0') sum++;
} else {
if (a[i] == '1') sum++;
}
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, x, y;
int operations = 0;
cin >> n >> x >> y;
char a[n];
cin >> a;
for (int l = n - x; l < n; l++) {
if (l == n - 1 - y && a[l] != '1')
operations++;
else if (l != n - 1 - y && a[l] != '0')
operations++;
}
cout << operations;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 4e5 + 5;
const int M = 1e6 + 5;
int trie[M << 2][2], tot = 1;
void Insert(long long x) {
int p = 1;
for (int i = 32; i >= 0; i--) {
int ch = (x >> i) & 1;
if (trie[p][ch] == 0) trie[p][ch] = ++tot;
p = trie[p][ch];
}
}
long long solve(long long x) {
int p = 1;
long long ans = 0;
for (int i = 32; i >= 0; i--) {
int ch = (x >> i) & 1;
if (trie[p][!ch]) {
ans += (1LL << i);
p = trie[p][!ch];
} else
p = trie[p][ch];
}
return ans;
}
long long a[M];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
int n, x, y;
cin >> n >> y >> x;
cin >> s;
int l = s.size();
reverse(s.begin(), s.end());
int sum = 0;
for (int i = 0; i < x; ++i) {
if (s[i] == '1') sum++;
}
if (s[x] == '0') sum++;
for (int i = x + 1; i <= y - 1; ++i) {
if (s[i] == '1') sum++;
}
cout << sum << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.