제출 #246059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246059		Vimmer	Tuna (COCI17_tuna)	C++14	50 / 50	5 ms	384 KiB

tuna

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
    ////freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int x;

    cin >> x;

    int sum = 0;

    for (int i = 0; i < n; i++)
    {
        int p1, p2;

        cin >> p1 >> p2;

        if (abs(p1 - p2) <= x) sum += max(p1, p2);
          else {int p3; cin >> p3; sum += p3;}
    }

    cout << sum << endl;
}

• Subtask 1: 50 / 50