# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
314417 | 2020-10-19T20:21:37 Z | urosk | Colouring a rectangle (eJOI19_colouring) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include <chrono> #define ll long long #define ull unsigned long long #define ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define inf 1e15 #define pb push_back #define popb pop_back #define fi first #define sc second using namespace std; using namespace std::chrono; /*auto start = high_resolution_clock::now(); auto stop = high_resolution_clock::now(); auto duration = duration_cast<microseconds>(stop - start); cout << "Time taken by function: " << duration.count() << " microseconds" << endl;*/ const int maxn = 1e5+1; int a[maxn]; int b[maxn]; int a[] int main(){ int n,m; cin >> n >> m; for(int i = 0;i<n+m+1){ cin >> a[i]; } for(int i = 0;i<n+m-1;i++){ cin >> b[i]; } if(n==m){ ll ans1 = 0; ll ans2 = 0; for(int i = 0;i<n;i++){ ans1+=a[i]; } for(int i = 0;i<n;i++){ ans2+=b[i]; } cout<<min(ans1,ans2); }else if(n==1){ ll ans = 0; for(int i = 0;i<m;i++){ ans+=min(a[i],b[i]); } cout<<ans; }else{ cout<<0; } }