提出 #76527662


ソースコード 拡げる

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

#define int long long
#define Int __int128_t
#define eb emplace_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pY cout << "YES\n"
#define pN cout << "NO\n"

const int MOD = 1e9 + 7;

vector<int> readv(int n)
{
    vector<int> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    return v;
}

void printv(vector<int> &v)
{
    for (int x : v)
        cout << x << ' ';
    cout << '\n';
}

void solve();

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int tt = 1;
    // cin >> tt;
    while (tt--)
    {
        solve();
        cout << "\n";
    }
    return 0;
}

void solve()
{
    int n, k;
    cin >> n >> k;
    auto v = readv(n);
    sort(rall(v));
    int a = v[0], b = v[1];
    int x = k / 2;
    int ans = x * (a + b);
    if (k % 2)
        ans += a;
    cout << ans;
}

提出情報

提出日時
問題 B - 連続禁止のトレーニング
ユーザ notrainboy
言語 C++23 (GCC 15.2.0)
得点 300
コード長 1007 Byte
結果 AC
実行時間 12 ms
メモリ 4288 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 300 / 300
結果
AC × 3
AC × 77
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3512 KiB
in02.txt AC 1 ms 3404 KiB
in03.txt AC 1 ms 3488 KiB
in04.txt AC 1 ms 3496 KiB
in05.txt AC 1 ms 3576 KiB
in06.txt AC 1 ms 3568 KiB
in07.txt AC 11 ms 4216 KiB
in08.txt AC 12 ms 4072 KiB
in09.txt AC 3 ms 3616 KiB
in10.txt AC 12 ms 4072 KiB
in11.txt AC 9 ms 3808 KiB
in12.txt AC 10 ms 4012 KiB
in13.txt AC 6 ms 4184 KiB
in14.txt AC 12 ms 4132 KiB
in15.txt AC 1 ms 3540 KiB
in16.txt AC 6 ms 4056 KiB
in17.txt AC 12 ms 4056 KiB
in18.txt AC 12 ms 4184 KiB
in19.txt AC 6 ms 4060 KiB
in20.txt AC 9 ms 4184 KiB
in21.txt AC 6 ms 4068 KiB
in22.txt AC 5 ms 4184 KiB
in23.txt AC 5 ms 4060 KiB
in24.txt AC 5 ms 4284 KiB
in25.txt AC 12 ms 4288 KiB
in26.txt AC 1 ms 3448 KiB
in27.txt AC 12 ms 4056 KiB
in28.txt AC 1 ms 3404 KiB
in29.txt AC 1 ms 3540 KiB
in30.txt AC 1 ms 3404 KiB
in31.txt AC 1 ms 3544 KiB
in32.txt AC 1 ms 3404 KiB
in33.txt AC 1 ms 3448 KiB
in34.txt AC 1 ms 3604 KiB
in35.txt AC 1 ms 3460 KiB
in36.txt AC 1 ms 3448 KiB
in37.txt AC 1 ms 3544 KiB
in38.txt AC 1 ms 3632 KiB
in39.txt AC 1 ms 3488 KiB
in40.txt AC 1 ms 3448 KiB
in41.txt AC 12 ms 4132 KiB
in42.txt AC 6 ms 3748 KiB
in43.txt AC 1 ms 3604 KiB
in44.txt AC 12 ms 4060 KiB
in45.txt AC 1 ms 3488 KiB
in46.txt AC 1 ms 3448 KiB
in47.txt AC 1 ms 3440 KiB
in48.txt AC 1 ms 3448 KiB
in49.txt AC 12 ms 4184 KiB
in50.txt AC 12 ms 4056 KiB
in51.txt AC 6 ms 3776 KiB
in52.txt AC 12 ms 4060 KiB
in53.txt AC 12 ms 4144 KiB
in54.txt AC 1 ms 3440 KiB
in55.txt AC 1 ms 3576 KiB
in56.txt AC 12 ms 4068 KiB
in57.txt AC 6 ms 3576 KiB
in58.txt AC 6 ms 3688 KiB
in59.txt AC 12 ms 4076 KiB
in60.txt AC 1 ms 3448 KiB
in61.txt AC 1 ms 3604 KiB
in62.txt AC 1 ms 3604 KiB
in63.txt AC 1 ms 3604 KiB
in64.txt AC 1 ms 3440 KiB
in65.txt AC 1 ms 3544 KiB
in66.txt AC 1 ms 3544 KiB
in67.txt AC 1 ms 3504 KiB
in68.txt AC 1 ms 3576 KiB
in69.txt AC 1 ms 3544 KiB
in70.txt AC 1 ms 3404 KiB
in71.txt AC 1 ms 3476 KiB
in72.txt AC 1 ms 3504 KiB
in73.txt AC 6 ms 4216 KiB
in74.txt AC 7 ms 4064 KiB
sample01.txt AC 1 ms 3632 KiB
sample02.txt AC 1 ms 3488 KiB
sample03.txt AC 1 ms 3504 KiB