This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
vector <int> a(n),b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
if(m==1){
int res=1e9;
for(int i=0;i<n;i++){
res=min(res,max(a[i],b[i]));
}
cout<<res<<"\n";
}
else{
set <pair <int,int> > st;
for(int i=0;i<n;i++){
st.insert({max(a[i],b[i]),i});
}
for(int i=0;i<m*n-n;i++){
int x=st.begin()->ff;
int id=st.begin()->ss;
st.erase(st.begin());
x+=max(a[id],b[id]);
st.insert({x,id});
}
cout<<st.begin()->ff<<"\n";
}
}
/*
4 25
1 2 3 4
1 2 3 4
3 3
19 4 5
2 6 2
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |