제출 #1147448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147448		erkanat	Cipele (COCI18_cipele)	C++20	18 / 90	24 ms	1860 KiB

cipele

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

typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<long long,long long> pl;
typedef long double ld;

#define all(s) s.begin(),s.end()
#define F first
#define S second
#define sz(a) a.size()
#define int long long

const int mod = 998244353;
const int INF = 1e18;
const int N = 100200;
const int M = 5000;
const int inf = 1e9;

long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

void solve() {
    int n,m;
    cin>>n>>m;
    int l[n+1];
    int r[n+1];
    for(int i=1;i<=n;++i) {
        cin>>l[i];
    }
    for(int i=1;i<=m;++i) {
        cin>>r[i];
    }
    sort(l+1,l+1+n);
    sort(r+1,r+1+m);
    int mx=0;
    for(int i=1;i<=n;++i) {
        mx=max(abs(l[i]-r[i]),mx);
    }
    cout<<mx<<'\n';
}

signed main() {
    ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
    int T=1;
    //cin>>T;
    while(T--) {
        solve();
    }
    return 0;
} 

• 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