온라인저지
[BOJ] 13866번: 팀 나누기
plzfday
2018. 3. 28. 18:15
풀이
(1, 2), (3, 4) -> 비교
(1, 3), (2, 4) -> 비교
(1, 4), (2, 3) -> 비교
코드
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 | #include <cstdio> inline int min(int a, int b) { return a < b ? a : b; } inline int abs(int a) { return a > 0 ? a : -a; } int main() { int ar[4]; for (int i = 0; i < 4; ++i) scanf("%d", &ar[i]); int Min = 123456789; int sum1 = ar[0] + ar[1], sum2 = ar[2] + ar[3]; int difference = abs(sum1 - sum2); Min = min(difference, Min); sum1 = ar[0] + ar[2], sum2 = ar[1] + ar[3]; difference = abs(sum1 - sum2); Min = min(difference, Min); sum1 = ar[0] + ar[3], sum2 = ar[1] + ar[2]; difference = abs(sum1 - sum2); Min = min(difference, Min); printf("%d\n", Min); return 0; } | cs |