Submission #672722

#	Time	Username	Problem	Language	Result	Execution time	Memory
672722		Charizard2021	Cipele (COCI18_cipele)	C++17	27 / 90	1089 ms	1876 KiB

cipele

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, m;
    cin >> n >> m;
    vector<long long> l(n);
    vector<long long> r(m);
    for(int i = 0; i < n; i++){
        cin >> l[i];
    }
    for(int i = 0; i < m; i++){
        cin >> r[i];
    }
    sort(l.begin(), l.end());
    sort(r.begin(), r.end());
    if(n == m){
        long long ans = INT_MIN;
        for(int i = 0; i < n; i++){
            ans = max(ans, abs(l[i] - r[i]));
        }
        cout << ans << "\n";
    }
    else{
        if(n > m){
            swap(n, m);
            swap(l, r);
        }
        bool isPaired[m];
        long long ans = INT_MIN;
        memset(isPaired, false, sizeof(isPaired));
        for(int i = 0; i < n; i++){
            int minCost = INT_MAX;
            int cur = -1;
            for(int j = 0; j < m; j++){
                if(isPaired[j]){
                    continue;
                }
                if(minCost > abs(l[i] - r[j])){
                    minCost = abs(l[i] - r[j]);
                    cur = j;
                }
            }
            ans = max(ans, abs(l[i] - r[i]));
            isPaired[cur] = true;
        }
        cout << ans << "\n";
    }
}

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