구현(Implementation)
백준 9076번: 점수 집계
cepiloth
2018. 9. 2. 12:46
반응형
https://www.acmicpc.net/problem/9076
1. 문제
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 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 | #include <iostream> #include <sstream> #include <string> #include <algorithm> #include <functional> #include <vector> #include <list> #include <queue> #include <deque> #include <map> #include <set> #include <stack> #include <math.h> #include <memory.h> using namespace std; #define MAX_SIZE 100 #define INF 0x7fffffff #define CENDL "\n" #define ll long long #define c_reverse(s) reverse(s.begin(), s.end()) #define c_sort(s) sort(s.begin(), s.end()) #define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i]; int main() { cin.tie(0); std::ios::sync_with_stdio(false); int n; cin >> n; while (n--) { vector<int> arr(5); for (int i = 0; i < 5; i++) { cin >> arr[i]; } sort(arr.begin(), arr.end()); vector<int> brr(3); int sum = 0; for (int i = 1; i < 5 - 1; i++) { brr[i - 1] = arr[i]; sum += arr[i]; } int cand = abs(brr[0] - brr[2]); if (cand >= 4) { cout << "KIN" << CENDL; } else { cout << sum << CENDL; } } return 0; } | cs |
반응형