## 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}$

• ${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

### Vaccine Distribution Codechef December Long challenge solution 2020

Vaccine Distribution  Codechef December Long challenge solution 2020- This Problem vaccine distribution is taken from December long challenge 2020. lets read problem statement. Problem statement- Finally, a COVID vaccine is out on the market and the Chefland government has asked you to form a plan to distribute it to the public as soon as possible. There are a total of  N N  people with ages  a 1 , a 2 , … , a N a 1 , a 2 , … , a N . There is only one hospital where vaccination is done and it is only possible to vaccinate up to  D D  people per day. Anyone whose age is  ≥ 80 ≥ 80  or  ≤ 9 ≤ 9  is considered to be  at risk . On each day, you may not vaccinate both a person who is at risk and a person who is not at risk. Find the smallest number of days needed to vaccinate everyone. Input The first line of the input contains a single integer  T T  denoting the number of test cases. The description of  T T  test cases follows. The first line of each test case contains two space-separ

### Codechef February long challenge solution 2021

Codechef February  long challenge solution 2021- Hey guys Welcome Again, A small update CodeChef February  long challenge solution 2021 starting from 1st week of beb  2021 . Codechef long challenge is one of the popular contests of CodeChef you should participate in codechef Feb  long challenge.This is first contest of codechef in 2021 so good luck. And wish you happy new year. Contest link- https://www.codechef.com/FEB21/?itm_medium=navmenu&itm_campaign=FEB21 I will post the solution after Contest.Stay tuned. About CodeChef  February  long challenge solution 2021: CodeChef Long Challenge is a 10-day monthly coding contest where you can show off your computer programming skills. The significance being - it gives you enough time to think about a problem, try different ways of attacking the problem, read the concepts etc. If you’re usually slow at solving problems and have ample time at hand, this is ideal for you. We also put in a lot of efforts in getting quality problems, w

### Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1