제출 #1263717

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1263717		CodeLakVN	Simfonija (COCI19_simfonija)	C++20	55 / 110	18 ms	1800 KiB

simfonija

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

#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

const int MAX_N = (int)1e5 + 5;

int n, k;
int a[MAX_N], b[MAX_N];

namespace sub1 {
    void solve() {
        vector<int> arr;
        long long ans = 0;

        FOR(i, 1, n)
            arr.push_back(a[i] - b[i]);

        sort(arr.begin(), arr.end());
        FOR(i, 0, n - 1)
            ans += abs(arr[i] - arr[n / 2]);

        cout << ans << "\n";
    }
}

namespace sub2 {
    vector<int> arr;

    long long getAns() {
        long long res = 0;
        FOR(i, 0, n - k - 1) {
            res += abs(arr[i] - arr[(n - k - 1) / 2]);
        }
        return res;
    }

    void solve() {
        long long ans = LLONG_MAX;

        FOR(i, 1, n)
            arr.push_back(a[i] - b[i]);

        sort(arr.begin(), arr.end());
        minimize(ans, getAns());
        reverse(arr.begin(), arr.end());
        minimize(ans, getAns());

        cout << ans << "\n";
    }
}

void solve() {
    cin >> n >> k;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) cin >> b[i];

    if (k == 0) sub1::solve();
    else sub2::solve();
}

int32_t main() {
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    bool multitest = 0;
    int numTest = 1;
    if (multitest) cin >> numTest;

    while (numTest--) {
        solve();
    }

    return 0;
}

/* Lak lu theo dieu nhac!!!! */

컴파일 시 표준 에러 (stderr) 메시지

simfonija.cpp: In function 'int32_t main()':
simfonija.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
simfonija.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 11 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 11 / 11