204B - Little Elephant and Cards - CodeForces Solution


binary search data structures *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using namespace std;

int main() {
ios_base::sync_with_stdio(0);
unordered_set<int> st;
unordered_map<int, int> aa, bb;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
aa[a]++;
if (a != b) bb[b]++;
st.insert(a);
st.insert(b);
}
int ans = 1e9;
for (auto i: st) {
if (aa[i] >= n/2+n%2) {
ans = 0;
} else if (aa[i] + bb[i] >= n/2+n%2) {
ans = min(ans, n/2+n%2 - aa[i]);
}
}
if (ans == 1e9) cout << "-1\n";
else cout << ans << '\n';
}


Comments

Submit
0 Comments
More Questions

983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III