結果
問題 | No.2852 Yakitori Optimization Problem |
ユーザー |
|
提出日時 | 2024-08-25 13:45:54 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 92 ms / 2,000 ms |
コード長 | 2,165 bytes |
コンパイル時間 | 23,329 ms |
コンパイル使用メモリ | 357,944 KB |
最終ジャッジ日時 | 2025-02-24 00:56:06 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 17 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#if __has_include("./cpp-dump/cpp-dump.hpp")#include "./cpp-dump/cpp-dump.hpp"#endif#include <chrono>#include <unistd.h>using namespace std;using namespace chrono;#define rep(i, n) for (ll i = 0; i < (n); ++i)#define rep1(i, n) for (ll i = 1; i <= (n); ++i)#define rrep(i, n) for (ll i = n; i > 0; --i)#define bitrep(i, n) for (ll i = 0; i < (1 << n); ++i)#define all(a) (a).begin(), (a).end()#define yesNo(b) ((b) ? "Yes" : "No")using ll = long long;using ull = unsigned long long;using ld = long double;using mint = modint998244353;using MINT = modint1000000007;string alphabet = "abcdefghijklmnopqrstuvwxyz";string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";constexpr double pi = 3.141592653589793;constexpr ll smallMOD = 998244353;constexpr ll bigMOD = 1000000007;constexpr ll dx[] = {1, 0, -1, 0, 1, -1, -1, 1};constexpr ll dy[] = {0, 1, 0, -1, 1, 1, -1, -1};struct Init{Init(){ios::sync_with_stdio(0);cin.tie(0);cout << fixed << setprecision(15);}} init;template <typename T>ostream &operator<<(ostream &os, const vector<T> &vec){os << "[";rep(i, vec.size()){os << vec[i];if (i != vec.size() - 1)os << ", ";}os << "]";return os;}template <typename T>ostream &operator<<(ostream &os, const vector<vector<T>> &vec){os << "[";rep(i, vec.size()){os << vec[i];if (i != vec.size() - 1)os << ", ";}os << "]";return os;}int main(){ll n, m;cin >> n >> m;vector<ll> a(n), b(n), c(n);rep(i, n) cin >> a[i];rep(i, n) cin >> b[i];rep(i, n) cin >> c[i];ll sm = accumulate(all(a), 0LL) + accumulate(all(b), 0LL);ll k = 0;vector<ll> diff(n);rep(i, n){diff[i] = c[i] - b[i];}sort(all(diff), greater<ll>());rep(i, n - m){sm += diff[i];}cout << sm << endl;return 0;}