[codeforces - 1047] Add C++ solution for B - Cover Points

abeaumont · abeaumont · commit a8580b83e8a3 · 2019-11-15T20:26:26.000+01:00
diff --git a/codeforces/1047/b-1.ans b/codeforces/1047/b-1.ans
@@ -0,0 +1 @@
+3
diff --git a/codeforces/1047/b-1.in b/codeforces/1047/b-1.in
@@ -0,0 +1,4 @@
+3
+1 1
+1 2
+2 1
diff --git a/codeforces/1047/b-2.ans b/codeforces/1047/b-2.ans
@@ -0,0 +1 @@
+4
diff --git a/codeforces/1047/b-2.in b/codeforces/1047/b-2.in
@@ -0,0 +1,5 @@
+4
+1 1
+1 2
+2 1
+2 2
diff --git a/codeforces/1047/b.cc b/codeforces/1047/b.cc
@@ -0,0 +1,16 @@
+// https://codeforces.com/contest/1047/problem/B
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long ll;
+
+int main() {
+  ll n,x,y,m=0;
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    cin >> x >> y;
+    m = max(m, x+y);
+  }
+  cout << m << endl;
+}
diff --git a/codeforces/README.md b/codeforces/README.md
@@ -23,7 +23,7 @@ There are solutions for the following [codeforces](http://codeforces.com/) conte
 - [Codeforces Round #518 (Div. 2)](1068) ([contest site](https://codeforces.com/contest/1068)):
   [A](1068/a.py), [B](1068/b.cc), [C](1068/c.cc), D, E, [F](1068/f.cc)
 - [Codeforces Round #511 (Div. 2)](1047) ([contest site](https://codeforces.com/contest/1047)):
-  [A](1047/a.py), B, C, D, E
+  [A](1047/a.py), [B](1047/b.cc), C, D, E
 - [Codeforces Round #510 (Div. 2)](1042) ([contest site](https://codeforces.com/contest/1042)):
   [A](1042/a.cc), [B](1042/b.cc), [C](1042/c.cc), D, E, F
 - [Codeforces Round #508 (Div. 2)](1038) ([contest site](https://codeforces.com/contest/1038)):

-Original file line number
+Diff line change
 +3
 +1 1
 +1 2
 +2 1