1663C - Pōja Verdon - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ll   long long
#define pb   push_back
#define yes   cout<<"YES"<<endl
#define no   cout<<"NO"<<endl
#define all(x) (x).begin(), (x).end()
#define    gcd(a,b)      __gcd(a,b)
#define    lcm(a,b)  (a*b)/__gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);


void solve(){
    ll n; cin>>n;
    vector<ll>v(n);
    ll sum=0;
    for(ll i=0; i<n; i++){
        cin>>v[i];
        sum+=v[i];
    }
    cout<<sum<<endl;

}

int main()
{
     optimize();
     ll t=1;
     //cin>>t;
     while(t--)  solve();
}