Submission #855720

#	Time	Username	Problem	Language	Result	Execution time	Memory
855720		vjudge1	Cipele (COCI18_cipele)	C++17	18 / 90	29 ms	1884 KiB

cipele

#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define ll long long
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 1000000007
#define lim 200005
using namespace std;








void solve(){
    int n,m; cin >> n >> m;
    if(n==m){
        int arr[n+1], brr[n+1];
        for(int i=1; i<=n; i++) cin >> arr[i];
        for(int i=1; i<=n; i++) cin >> brr[i];
        sort(arr+1, arr+n+1);
        sort(brr+1, brr+n+1);
        int ans=0;
        for(int i=1; i<=n; i++) ans = max(ans, abs(arr[i]-brr[i]));
        cout << ans << endl;
    }
}



signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in","r",stdin);
    freopen("out","w",stdout);
    #endif

    ll t=1;
    //cin >> t;
    while(t--) solve();
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 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