# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
409717 | dreezy | Wiring (IOI17_wiring) | C++17 | 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;
int min_total_length(int r0[], int b0[]){
vector<int> r(r0, r0 + sizeof(*r0));
int ans = 0;
int ind = 0;
for( int a : r){
ans+= b0[ind] - r[ind];
ind++;
}
return ans;
}
/*
int main(){
//int n, m; cin >> n >> m;
int r[5] = {1,2,3,4,5};
int b[5] = {2,3,4,5,6};
cout << min_total_length(r, b)<<endl;
}*/