Submission #472297

#	Time	Username	Problem	Language	Result	Execution time	Memory
472297		Ahmed57	Cipele (COCI18_cipele)	C++14	18 / 90	71 ms	5344 KiB

cipele

#include<bits/stdc++.h>
using namespace std;
void solve()
{


}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    int arr[100000];
    multiset<int>ms;
    if(n<=m){
        for(int i=0;i<n;i++){
            cin>>arr[i];
        }
        for(int i=0;i<m;i++){
            int x;
            cin>>x;
            ms.insert(x);
        }
        sort(arr,arr+n);
    }
    else{
        for(int i=0;i<n;i++){
            int x;
            cin>>x;
            ms.insert(x);
        }
        for(int i=0;i<m;i++){
            cin>>arr[i];
        }
        sort(arr,arr+m);
    }
    int ans=0;
    for(int i=0;i<min(n,m);i++){
        int x = arr[i];
        auto it1=ms.upper_bound(x);
        auto it2=ms.upper_bound(x);
        if(it1!=ms.begin()){
            it1--;
        }
        if(it2!=ms.end()){
            if(abs(x-*it1)<=abs(x-*it2)){
                ans=max(ans,abs(x-*it1));
                ms.erase(it1);
            }
            else{
                ans=max(ans,abs(x-*it2));
                ms.erase(it2);
            }
        }
        else{
            ans=max(ans,abs(x-*it1));
            ms.erase(it1);
        }
    }
    cout<<ans<<endl;
	return 0;
}

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