提出 #74619504

---

ソースコード 拡げる

#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
#define PB push_back
#define len(s) (ll)s.size()
#define printl(x) cout<<x<<'\n'
#define print(x) cout<<x
#define fore(i,l,r) for(ll i=l; i<r; i++)
#define endl '\n'
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) x.begin(), x.end()
#define maxt(v) *max_element(all(v))
#define mint(v) *min_element(all(v))
#define srt(v) sort(all(v))

ll mod = 1000000007;
void Sieve(int n, vector<bool> &a, vi &b){
    a.resize(n+1, true);
    a[0] = a[1] = false;
    for (int p = 2; p*p<= n; p++) {
        if (a[p] == true) {
            b.PB(p);
            for (int i = p * p; i <= n; i += p){
               a[i] = false;
            }
        }
    }
}

const long long MOD = 1e9 + 7;
long long modpow(long long a, long long b) {
    long long res = 1;
    a %= MOD;
    while (b > 0) {
        if (b & 1) res = (res * a) % MOD;
        a = (a * a) % MOD;
        b >>= 1;
    }
    return res;
}

long long modinv(long long q) {
    return modpow(q, MOD - 2);
}
// long long ans = (p * modinv(q)) % MOD;

void solve(){
    ll n,m,s;
    cin >> n >> m >>s;
    vi a(n);
    fore(i,0,n) cin >> a[i];
    ll ans = s;
    fore(i,0,m){
        int t,q;
        cin >> t >> q;
        ans+=(a[t-1]*q);
        ans-=((a[t-1]*q)/2);
    }
    cout << ans << endl;
}

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

提出情報

ジャッジ結果