cses

commit 25869b2748dada3684846d0b4b82a6335530c5a8
parent 194918e631e5172d0cab393d843a10bcc93fc3f5
Author: superpozycja <anna@superpozycja.net>
Date:   Sun, 27 Oct 2024 22:57:58 +0100

solve sum of two values

Diffstat:
A
sorting_and_searching/sum_of_two_values.cpp
 | 
64
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

1 file changed, 64 insertions(+), 0 deletions(-)
diff --git a/sorting_and_searching/sum_of_two_values.cpp b/sorting_and_searching/sum_of_two_values.cpp
@@ -0,0 +1,64 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ui = unsigned int;
+using l = long;
+using ul = unsigned long;
+using ll = long long;
+using ull = unsigned long long;
+
+using vi = vector<int>;
+using vui = vector<ui>;
+using vl = vector<l>;
+using vul = vector<ul>;
+using vll = vector<ll>;
+using vull = vector<ull>;
+
+void solve()
+{
+	int n, x;
+	cin >> n >> x;
+	int t[n];
+	int og[n];
+	for (int i = 0; i < n; i++) {
+		cin >> t[i];
+		og[i] = t[i];
+	}
+
+	sort(t, t + n);
+
+	int i = 0, j = n-1;
+
+	while (i < j) {
+		if (t[i] + t[j] > x) {
+			j--;
+		} else if (t[i] + t[j] < x) {
+			i++;
+		} else {
+			int fi = 0, fj = 0;
+			for (int x = 0; x < n; x++) {
+				if(og[x] == t[i] && !fi) {
+					cout << x+1 << " ";
+					fi = 1;
+					continue;
+				}
+				if(og[x] == t[j] && !fj) {
+					cout << x+1 << " ";
+					fj = 1;
+				}
+			}
+			cout << "\n";
+			return;
+
+		}
+	}
+
+	cout << "IMPOSSIBLE\n";
+
+}
+
+int main()
+{
+	solve();
+}