MORGAN STANLEY OA Help : Interview Help
Open in Telegram
Codeforces Codechef Leetcode AtCoder GFG CodeStudio All Contests Solutions available.
Show more893
Subscribers
-124 hours
-27 days
-530 days
Posts Archive
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define tCases \
int tcc; \
cin >> tcc; \
while (tcc--)
void B()
{
int n;
cin >> n;
vector<int> arr(n * 2);
for (int i = 0; i < n * 2; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
cout << arr[n - 1] - arr[0] + arr[2 * n - 1] - arr[n] << endl;
for (int i = 0; i < n; i++)
cout << arr[i] << ' ' << arr[i + n] << endl;
}
signed main()
{
tCases
answer();
return 0;
}
// B
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define t \
int tc; \
cin >> tc; \
while (tc--)
void code()
{
int x, y, k;
cin >> x >> y >> k;
if (x >= y)
cout << x << endl;
else if (x + k >= y)
cout << y << endl;
else
{
x += k;
y += (y - x);
cout << y << endl;
}
}
signed main()
{
t code();
return 0;
}
// A
Div 2
A,B,C done β
Playing with OR
Guess the winner!
Save People
These done β
Dm fast β³
All for 30 β€οΈβπ₯
