답안 #368353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
368353 2021-02-20T00:49:53 Z TosakaUCW Tuna (COCI17_tuna) C++17
50 / 50
1 ms 384 KB
#include <stdio.h>
#include <algorithm>
#include <memory.h>

int read(int x = 0, int f = 0, char ch = getchar())
{
    while ('0' > ch or ch > '9')
        f = ch == '-', ch = getchar();
    while ('0' <= ch and ch <= '9')
        x = x * 10 + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

int n, k, ans;

int main()
{
    // freopen("tuna.in", "r", stdin), freopen("tuna.out", "w", stdout);
    n = read(), k = read();
    for (int x, y; n--;)
        x = read(), y = read(), ans += abs(x - y) <= k ? std::max(x, y) : read();
    return printf("%d", ans), 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct