eolymp
bolt
Try our new interface for solving problems
Problems

Cards game

published at 2/6/24, 11:09:11 am

include <bits/stdc++.h>

using namespace std; void solve(){

int n;
cin>>n;
deque<int>dq;
long long cnt1=0;
for(int i=0;i<n;i++){
    int a;cin>>a;cnt1+=a;dq.emplace_back(a);
}
long long cnt2=0;
for(int i=0;i<n/2;i++){
    cnt2 += max(dq[i],dq[n-i-1]);
}

cout<<cnt1-cnt2<<' '<<cnt2; } int main(){

ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
solve();

}

published at 2/6/24, 11:11:51 am

include <bits/stdc++.h>

define ll long long int

define ld long double

using namespace std; int main(){

ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, ans = 0, say = 0;
cin>>n;
deque<ll>dq;
for(int i = 0; i<n; i++){
    ll k;
    cin>>k;
    dq.push_back(k);
}
for(int i = 0; i<n; i++){
    ll m, k;
    m = dq[0];
    k = dq[dq.size()-1];
    if(i%2 == 0){
        if(m > k){
            ans+=(m);
            dq.pop_front();
        }
        else{
            ans+=(k);
            dq.pop_back();
        }
    }
    else{
        if(m > k){
            say+=(m);
            dq.pop_front();
        }
        else{
            say+=(k);
            dq.pop_back();
        }
    }
}
cout<<ans<<' '<<say;

} //TECHNOBLADE NEVER DIES