# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088915 | mar | Colouring a rectangle (eJOI19_colouring) | C++14 | 0 ms | 0 KiB |
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>
using namespace std;
typedef long long ll;
ll n,m,arr[1000006];
int main (){
cin>>n>>m;
for(ll i=0;i<2*n+2*m-2;i++) cin>>arr[i];
for(ll i=0;i<n+m-1;i++){
ans=ans+min(arr[i],arr[2*n+2*m-2-i-1]);
}
cout<<ans<<endl;
return 0;
}