Added a debug.h which contains all nesccseary functions to debug my code

1 files changed, 30 insertions, 85 deletions

diff --git a/codeforces/ChipsOnTheBoard/main.cpp b/codeforces/ChipsOnTheBoard/main.cpp
index cd05891..ebbd4b5 100755
--- a/codeforces/ChipsOnTheBoard/main.cpp
+++ b/codeforces/ChipsOnTheBoard/main.cpp
@@ -1,9 +1,12 @@
+#include <algorithm>
 #include <bits/stdc++.h>
+#include <numeric>
+
 using namespace std;
 
 using ll = long long;
 using pii = pair<int, int>;
-using vpi = vector<pii>;
+using vpii = vector<pii>;
 using vi = vector<int>;
 using vll = vector<long long>;
 using mpii = map<int, int>;
@@ -20,92 +23,16 @@ using db = long double;
   (x).resize(unique(all((x))) - (x).begin())
 #define ceil(a, b) ((a) + (b)-1) / (b)
 
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
 const int dx[4]{1, 0, -1, 0};
 const int dy[4]{0, 1, 0, -1};
 
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const pair<K, V> &p);
-template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const map<K, V> &m);
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
-template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
-template <typename T>
-ostream &operator<<(ostream &os, const unordered_set<T> &s);
-
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const pair<K, V> &p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0)
-      os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const map<K, V> &m) {
-  os << "{";
-  for (const auto &p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template <typename K, typename V>
-ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
-  os << "{";
-  for (const auto &p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
-  int i = 0;
-  os << "{";
-  for (const auto &e : s) {
-    if (i > 0)
-      os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template <typename T>
-ostream &operator<<(ostream &os, const unordered_set<T> &s) {
-  int i = 0;
-  os << "{";
-  for (const auto &e : s) {
-    if (i > 0)
-      os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void dbg() { cerr << "\n"; }
-
-template <typename T, typename... TS> void dbg(T val, TS... vals) {
-  cerr << val << " ";
-  dbg(vals...);
-}
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
 
 /* stuff you should look for:
   ---------------------------
@@ -116,7 +43,25 @@ template <typename T, typename... TS> void dbg(T val, TS... vals) {
    * DON'T GET STUCK ON ONE APPROACH
  */
 
-void solve() {}
+void solve() {
+  ll n;
+  cin >> n;
+  vll a(n), b(n);
+  for (auto &x : a) {
+    cin >> x;
+  }
+  for (auto &x : b) {
+    cin >> x;
+  }
+
+  ll sum_a = accumulate(all(a), 0LL);
+  ll sum_b = accumulate(all(b), 0LL);
+  ll min_a = *min_element(all(a));
+  ll min_b = *min_element(all(b));
+  dbg(sum_a, sum_b);
+
+  cout << min(min_a * n + sum_b, min_b * n + sum_a) << '\n';
+}
 
 int main() {
   ios_base::sync_with_stdio(false);