백준 3058번: 짝수를 찾아라

https://www.acmicpc.net/problem/3058

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#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;
        int sum = 0;
        for(int i=0; i<7; i++) {
            int d; cin >> d;
            if (d % 2 == 0) {
                arr.push_back(d);
                sum += d;
            }
        }
        sort(arr.begin(), arr.end());
        cout << sum << " " << arr[0] << CENDL;
    }
    return 0; 
}