CodeForces-Solutions/2013B.cpp at main · garvit018/CodeForces-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
<<<<<<< HEAD
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        ll n;
        cin >> n;
        ll arr[n];
        ll sum = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
            sum += arr[i];
        }
        // this shows that arr[n-1]- arr[n-2] hona toh pacca hai toh apan ko arr[n-2] ko jitna ho ske utna
        // kam karna hai. Wo chiz tb hi ho skti jb arr[n-2] ko harr kisi se fight krwaye
        // toh pehele arr[0]......arr[n-1] sum nikal lo phir uss mai 2*arr[n-2] subtract krdo
        // kyuki arr[n-2] ek baar add ho chuka and ek baar toh subtract karna hi hai
        // issliye 2 baar subtract krna hai
        //  for (int i = 0; i < n - 2; i++)
        //  {
        //      sum += arr[i];
        //  }
        //  cout << arr[n - 1] - (arr[n - 2] - sum) << endl;

        cout << sum - 2 * arr[n - 2] << endl;
    }
    return 0;
=======
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        ll n;
        cin >> n;
        ll arr[n];
        ll sum = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
            sum += arr[i];
        }
        // this shows that arr[n-1]- arr[n-2] hona toh pacca hai toh apan ko arr[n-2] ko jitna ho ske utna
        // kam karna hai. Wo chiz tb hi ho skti jb arr[n-2] ko harr kisi se fight krwaye
        // toh pehele arr[0]......arr[n-1] sum nikal lo phir uss mai 2*arr[n-2] subtract krdo
        // kyuki arr[n-2] ek baar add ho chuka and ek baar toh subtract karna hi hai
        // issliye 2 baar subtract krna hai
        //  for (int i = 0; i < n - 2; i++)
        //  {
        //      sum += arr[i];
        //  }
        //  cout << arr[n - 1] - (arr[n - 2] - sum) << endl;

        cout << sum - 2 * arr[n - 2] << endl;
    }
    return 0;
>>>>>>> 4bb7f1e9c9149de1c5c4e3b2a9a463945e04b545
}