-
Notifications
You must be signed in to change notification settings - Fork 1
/
fairelect.c
97 lines (87 loc) · 1.88 KB
/
fairelect.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
// author:Hemant1101
// lang: C
// topic:Codechef problems ( file name is the problem code )
#include <stdio.h>
void swap(int *a, int *b)
{
int t = *a;
*a = *b;
*b = t;
}
int total(int arr[], int n)
{
int sum = 0, i;
for (i = 0; i < n; i++)
{
sum = sum + arr[i];
}
return sum;
}
int partition(int arr[], int low, int high)
{
int pivot = arr[high];
int i = (low - 1);
int j;
for (j = low; j <= high - 1; j++)
{
if (arr[j] < pivot)
{
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void quickSort(int arr[], int low, int high)
{
if (low < high)
{
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n, m, count = 0, temp;
scanf("%d %d", &n, &m);
int arrn[n], arrm[m];
int sumn = 0, summ = 0;
int i;
for (i = 0; i < n; i++)
{
scanf("%d", &arrn[i]);
sumn = sumn + arrn[i];
}
for (i = 0; i < m; i++)
{
scanf("%d", &arrm[i]);
summ = summ + arrm[i];
}
int low = 0, high = m - 1;
while (sumn <= summ)
{
quickSort(arrn, 0, n - 1);
quickSort(arrm, 0, m - 1);
if (arrn[0] > arrm[m - 1])
{
count = -1;
break;
}
swap(&arrn[0], &arrm[m - 1]);
sumn = total(arrn, n);
summ = total(arrm, m);
low++;
high--;
count++;
}
printf("%d", count);
printf("\n");
}
return 0;
}