Submission #85074

#	Time	Username	Problem	Language	Result	Execution time	Memory
85074		Linst90	Cipele (COCI18_cipele)	C++11	27 / 90	130 ms	10152 KiB

cipele

#include<iostream>
#include<vector>
#include<algorithm>
using namespace::std;

int main(){
    int n,m;
    cin>>n>>m;
    vector<int> f;
    vector<int> s;
    if(n>m){
        for(int i=0,t;i<n;i++)
            cin>>t,s.push_back(t);
        for(int i=0,t;i<m;i++)
            cin>>t,f.push_back(t);
        swap(n,m);
    }else{
        for(int i=0,t;i<n;i++)
            cin>>t,f.push_back(t);
        for(int i=0,t;i<m;i++)
            cin>>t,s.push_back(t);
    }
    sort(f.begin(),f.end(),greater_equal<int>());
    sort(s.begin(),s.end(),greater_equal<int>());

    int pos=0;
    for(int i=1;i<m-n+1;i++){
        if(abs(f[0]-s[i])<=abs(f[0]-s[pos])) pos=i;
    }
    int maxn=0;
    for(int i=pos,t=pos;i<pos+n;i++)
        maxn=max(abs(f[i-t]-s[i]),maxn);//,cout<<abs(f[i-t]-s[i])<<' '<<i-t<<' '<<i<<'\n';
    cout<<maxn<<'\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