Skip to main content

## Fair Elections Codechef January long challenge  2021 solution || Fair Elections Codechef January 2021 Editorial -

### Problem Statement-

Elections are coming soon. This year, two candidates passed to the final stage. One candidate is John Jackson and his opponent is Jack Johnson.

During the elections, everyone can vote for their favourite candidate, but no one can vote for both candidates. Then, packs of votes which went to the same candidate are formed. You know that for John Jackson, there are $N$ packs containing ${A}_{1},{A}_{2},\dots ,{A}_{N}$ votes, and for Jack Johnson, there are $M$ packs containing ${B}_{1},{B}_{2},\dots ,{B}_{M}$ votes.

The winner is the candidate that has strictly more votes than the other candidate; if both have the same number of votes, there is no winner. You are a friend of John Jackson and you want to help him win. To do that, you may perform the following operation any number of times (including zero): choose two packs of votes that currently belong to different candidates and swap them, i.e. change the votes in each of these packs so that they would go to the other candidate.

You are very careful, so you want to perform as few swaps as possible. Find the smallest number of operations you need to perform or determine that it is impossible to make John Jackson win.

### Input

• The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
• The first line of each test case contains two space-separated integers $N$ and $M$.
• The second line contains $N$ space-separated integers ${A}_{1},{A}_{2},\dots ,{A}_{N}$.
• The third line contains $M$ space-separated integers ${B}_{1},{B}_{2},\dots ,{B}_{M}$.

### Output

For each test case, print a single line containing one integer ― the smallest number of swaps needed to make John Jackson win, or $-1$ if it is impossible.

### Constraints

• $1\le T\le {10}^{3}$
• $1\le N,M\le {10}^{3}$
• $1\le {A}_{i}\le {10}^{6}$ for each valid $i$
• $1\le {B}_{i}\le {10}^{6}$ for each valid $i$
• the sum of $N$ over all test cases does not exceed ${10}^{4}$
• the sum of $M$ over all test cases does not exceed ${10}^{4}$

### Subtasks

Subtask #1 (20 points):

• ${A}_{1}={A}_{2}=\dots ={A}_{N}$
• ${B}_{1}={B}_{2}=\dots ={B}_{M}$

Subtask #2 (80 points): original constraints

### Example Input

2
2 3
2 2
5 5 5
4 3
1 3 2 4
6 7 8


### Example Output

2
1


### Explanation

Example case 1: We can perform two swaps ― each time, we swap a pack of $2$ votes from $A$ and a pack of $5$ votes from $B$. After that, John Jackson gets $5+5=10$ votes and Jack Johnson gets $2+2+5=9$ votes.

Example case 2: We can swap the pack of $1$ vote from $A$ and the pack of $8$ votes from $B$. After that, John Jackson gets $8+3+2+4=17$ votes and Jack Johnson gets $6+7+1=14$ votes.

### Solution-

This problem can be solved using brute force approach first we sort both array and we will iterate second array from last and first array form first till we get sum1>sum2  .
after swapping if sum1<sum2 print -1
sum1>sum2 print count of swaping
else print 0
her is my code follow code below.
Join telegram channel for code and editorial.-https://t.me/competitiveProgrammingDiscussion

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

Concert Tickets Cses Problem set solution- Porblem statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  concert tickets available, each with a certain price. Then,  m m  customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers  n n  and  m m : the number of tickets and the number of customers. The next line contains  n n  integers  h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains  m m  integers  t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print  − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅