asd

task_01/src/main.cpp

@@ -1,3 +1,23 @@
 #include <iostream>
+#include <vector>
 
-int main() { return 0; }
+// proverka 2
+
+int main() {
+  int a;
+  int x;
+  std::cin >> a;
+  std::vector<int> b;
+  while (std::cin >> x) {
+    b.push_back(x);
+  }
+
+  int i = 0;
+  int j = b.size() - 1;
+  while (b[i] + b[j] != a) {
+    if (b[i] + b[j] < a) i++;
+    if (b[i] + b[j] > a) j--;
+  }
+  std::cout << b[i] << ' ' << b[j] << '\n';
+  return 0;
+}

task_01/src/test.cpp

@@ -1,8 +1,13 @@
-
 #include <gtest/gtest.h>
 
-#include "topology_sort.hpp"
+#include <vector>
+
+#include "utils.hpp"
+
+TEST(main, Simple) {
+  ASSERT_EQ(Task1(9, std::vector<int>{1, 2, 4, 5, 6, 8, 10, 12}),
+            (std::pair<int, int>{1, 8}));
 
-TEST(TopologySort, Simple) {
-  ASSERT_EQ(1, 1);  // Stack []
-}
+  ASSERT_EQ(Task1(39, std::vector<int>{1, 2, 4, 5, 6, 9, 10, 35}),
+            (std::pair<int, int>{4, 35}));
+}

task_01/src/utils.cpp

@@ -0,0 +1,11 @@
+#include "utils.hpp"
+
+std::pair<int, int> Task1(int m, std::vector<int> a) {
+  int i = 0;
+  int j = a.size() - 1;
+  while (a[i] + a[j] != m) {
+    if (a[i] + a[j] < m) i++;
+    if (a[i] + a[j] > m) j--;
+  }
+  return {a[i], a[j]};
+}

task_01/src/utils.hpp

@@ -0,0 +1,4 @@
+#include <iostream>
+#include <vector>
+
+std::pair<int, int> Task1(int n, std::vector<int> a);