Submission #73386277

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) x.begin(), x.end()

bool __dbg = true;

void debug_out() { cerr << "\n"; }
template<typename T>
void debug_out(const T &t) { cerr << t << "\n"; }
template<typename T, typename... Args>
void debug_out(const T &t, const Args&... args) { cerr << t << " "; debug_out(args...); }
#define debug(...) do { if(__dbg){ cerr << #__VA_ARGS__ << ": "; debug_out(__VA_ARGS__); } } while(0)

template<typename T>
void debugv(const vector<T>& v){
    if(!__dbg) return;
    cerr << "[ ";
    for(auto &x : v) cerr << x << " ";
    cerr << "]\n";
}

// ---------------- INPUT VECTOR ----------------
vector<int>input_vec(int n) {
   vector<int>a(n);
   for(int i = 0 ; i < n ; i++) cin>>a[i];
   return a;
}
// ---------------- PREFIX SUM ----------------
vector<int> build_prefix(const vector<int>& a) {
    int n = a.size();
    vector<int> prefix(n, 0);
    prefix[0] = a[0];
    for (int i = 1; i < n; i++) {
        prefix[i] = prefix[i - 1] + a[i];
    }
    return prefix;
}

int range_sum(const vector<int>& prefix, int l, int r) {
    if (l == 0) return prefix[r];
    return prefix[r] - prefix[l - 1];
}

// ---------------- SUFFIX SUM ----------------
vector<int> build_suffix(const vector<int>& a) {
    int n = a.size();
    vector<int> suffix(n + 1, 0);
    for (int i = n - 1; i >= 0; i--) {
        suffix[i] = suffix[i + 1] + a[i];
    }
    return suffix;
}

int range_sum_suffix(const vector<int>& suffix, int l, int r) {
    return suffix[l] - suffix[r + 1];
}

#define FILE_NAME ""

void solve() {
	int n,m;
	cin>>n>>m;
	int E = LLONG_MAX;
	for(int i = 0; i < n; i++){
		int e;
		cin>>e;
		E = min(E, e);
	}
	int C = 0;
	for(int i = 0; i < m; i++){
		int c;
		cin>>c;
		C+=c;
	}
	cout<<E*C<<"\n";
}

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // freopen(FILE_NAME ".in", "r", stdin);
    // freopen(FILE_NAME ".out", "w", stdout);

    int t = 1;
    //cin >> t;
    while(t--) solve();

    return 0;
}

/*
------------------------------HETWIZZY DEBUG CHECKLIST-----------------------------------
       0. Enough array size? Enough array size? Enough array size? Integer overflow?
       1. Think TWICE, Code ONCE!
          Are there any counterexamples to your algo?
       2. Be careful about the BOUNDARIES!
          N=1? P=1? Something about 0?
       3. Do not make STUPID MISTAKES!
          Time complexity? Memory usage? Precision error?
          Reread the f*cking problem
*/

Submission Info

Judge Result