Submission #472451

#	Time	Username	Problem	Language	Result	Execution time	Memory
472451		Beboo44	Cipele (COCI18_cipele)	C++17	18 / 90	104 ms	3396 KiB

cipele

#include <bits/stdc++.h>
using namespace std;
#define all(v)			((v).begin()), ((v).end())
#define sz(v)			((int)((v).size()))
typedef long long ll;
typedef vector<int> vi;
typedef vector<pair<ll , int> > vpli;
typedef set<char> st;
typedef stack<int> s;
typedef deque<int> dq;
typedef queue<int> q;
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0)




int main()
{
 ll n,m;
 cin>>n>>m;
 vector<ll>leftt(n);
 vector<ll>rightt(m);
 for(int i=0; i<n; ++i){
    cin>>leftt[i];
 }
for(int i=0; i<m; ++i){
    cin>>rightt[i];
 }
 sort(leftt.begin(),leftt.end());
 sort(rightt.begin(),rightt.end());
 ll a;
 ll b;
 if(leftt.size()>rightt.size()){

 while(leftt.size()!=rightt.size()){
    if(abs(leftt[0]-rightt[0])>abs(rightt[m-1]-leftt[n-1])){
        leftt.erase(leftt.begin());
    }
    else{
        leftt.erase(leftt.begin()+n-1);
    }
 }
 }
 else if (rightt.size()>leftt.size()){

 while(leftt.size()!=rightt.size()){
    if(abs(leftt[0]-rightt[0])>abs(rightt[m-1]-leftt[n-1])){
        rightt.erase(rightt.begin());
    }
    else{
        rightt.erase(rightt.begin()+m-1);
    }
 }
 }

 ll ans=0;
 for(int i=0; i<leftt.size(); ++i){
    ans=max(ans,abs(leftt[i]-rightt[i]));
 }
 cout<<ans;


    return 0;
}

Compilation message (stderr)

cipele.cpp: In function 'int main()':
cipele.cpp:57:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i=0; i<leftt.size(); ++i){
      |               ~^~~~~~~~~~~~~
cipele.cpp:31:5: warning: unused variable 'a' [-Wunused-variable]
   31 |  ll a;
      |     ^
cipele.cpp:32:5: warning: unused variable 'b' [-Wunused-variable]
   32 |  ll b;
      |     ^

• 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