-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2309.cpp
70 lines (64 loc) · 932 Bytes
/
2309.cpp
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
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
void ft_swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void Qsort(int *arr, int l, int r)
{
int i;
int j;
int pivot;
i = l;
j = r;
pivot = arr[(l + r) / 2];
while (i <= j)
{
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j)
{
ft_swap(&arr[i], &arr[j]);
i++;
j--;
}
}
if (l < j)
Qsort(arr, l, j);
if (i < r)
Qsort(arr, i, r);
}
int main(void)
{
int N[10];
int sum, i, j;
sum = 0;
for (int i = 0; i < 9; i++)
{
scanf("%d", &N[i]);
sum += N[i];
}
Qsort(N, 0, 8);
i = 0;
while (i < 9)
{
j = i + 1;
while (j < 9)
{
if (sum - (N[i] + N[j]) == 100)
break;
j++;
}
if (sum - (N[i] + N[j]) == 100)
break;
i++;
}
for (int k = 0; k < 9; k++)
if (k != i && k != j)
printf("%d\n", N[k]);
}