제출 #1167934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167934		sunflower	Tuna (COCI17_tuna)	C++17	50 / 50	0 ms	328 KiB

tuna

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define SZ(x) ((int) (x).size())
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(x) cerr << "[" << #x << " = " << (x) << "]" << endl

#define left    __left
#define right   __right
#define prev    __prev
#define fi      first
#define se      second

template <class X, class Y>
    bool maximize(X &x, Y y) {
        if (x < y) return x = y, true;
        else return false;
    }

template <class X, class Y>
    bool minimize(X &x, Y y) {
        if (x > y) return x = y, true;
        else return false;
    }

int numFish, constValue;

int main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    cin >> numFish;
    cin >> constValue;

    int ans = 0;
    while (numFish--) {
        int P1, P2, P3;
        cin >> P1 >> P2;
        if (abs(P1 - P2) <= constValue) ans += max(P1, P2);
        else {
            cin >> P3;
            ans += P3;
        }
    }

    cout << ans;

    return 0;
}

/* Discipline - Calm */

• Subtask 1: 50 / 50