From 7b8991da134381da729125392bc3f085e9fea53e Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Thu, 7 Sep 2023 20:53:25 +0300
Subject: Removed some additional binaries

---
 contests/Round895/B/main             | Bin 0 -> 21512 bytes
 contests/Round895/B/main.cpp         | 145 +++++++++++++++++++++++++++++++++++
 contests/Round895/B/main_input0.txt  |  24 ++++++
 contests/Round895/B/main_output0.txt |   7 ++
 4 files changed, 176 insertions(+)
 create mode 100755 contests/Round895/B/main
 create mode 100755 contests/Round895/B/main.cpp
 create mode 100644 contests/Round895/B/main_input0.txt
 create mode 100644 contests/Round895/B/main_output0.txt

(limited to 'contests/Round895/B')

diff --git a/contests/Round895/B/main b/contests/Round895/B/main
new file mode 100755
index 0000000..a001703
Binary files /dev/null and b/contests/Round895/B/main differ
diff --git a/contests/Round895/B/main.cpp b/contests/Round895/B/main.cpp
new file mode 100755
index 0000000..25927ff
--- /dev/null
+++ b/contests/Round895/B/main.cpp
@@ -0,0 +1,145 @@
+#include <bits/stdc++.h>
+#include <climits>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (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 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...);
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  vector<vi> v(201);
+  int mn = INT_MAX;
+  for (int i = 0; i < n; i++) {
+    int s, d;
+    cin >> s >> d;
+    if (d % 2 == 0) {
+      mn = min(mn, s + (d / 2 - 1));
+    } else {
+      mn = min(mn, s + d / 2);
+    }
+  }
+  cout << mn << endl;
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/contests/Round895/B/main_input0.txt b/contests/Round895/B/main_input0.txt
new file mode 100644
index 0000000..4db719c
--- /dev/null
+++ b/contests/Round895/B/main_input0.txt
@@ -0,0 +1,24 @@
+7
+1
+2 2
+3
+2 8
+4 3
+5 2
+1
+200 200
+4
+1 20
+5 9
+3 179
+100 1
+2
+10 1
+1 18
+2
+1 1
+1 2
+3
+1 3
+1 1
+1 3
diff --git a/contests/Round895/B/main_output0.txt b/contests/Round895/B/main_output0.txt
new file mode 100644
index 0000000..b8bb869
--- /dev/null
+++ b/contests/Round895/B/main_output0.txt
@@ -0,0 +1,7 @@
+2
+5
+299
+9
+9
+1
+1
-- 
cgit v1.2.3