We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a8263bc commit 66c785cCopy full SHA for 66c785c
2022/Contests/Div 2/778/Programs/Maximum Cake Tastiness.cpp
@@ -0,0 +1,34 @@
1
+#include <iostream>
2
+#include <vector>
3
+#include <algorithm>
4
+
5
+using namespace std;
6
7
+void solve()
8
+{
9
+ int no_of_elements;
10
+ cin >> no_of_elements;
11
12
+ vector <int> A(no_of_elements + 1);
13
+ for(int i = 1; i <= no_of_elements; i++)
14
+ {
15
+ cin >> A[i];
16
+ }
17
18
+ sort(A.begin() + 1, A.end());
19
+ reverse(A.begin() + 1, A.end());
20
21
+ long long sum = A[1] + A[2];
22
+ cout << sum << "\n";
23
+}
24
25
+int main()
26
27
+ int no_of_test_cases;
28
+ cin >> no_of_test_cases;
29
30
+ while(no_of_test_cases--)
31
+ solve();
32
33
+ return 0;
34
0 commit comments