Submission #74618653

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define Int __int128_t
#define eb emplace_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pY cout << "YES\n"
#define pN cout << "NO\n"

const int MOD = 1e9 + 7;

vector<int> readv(int n)
{
    vector<int> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    return v;
}

void printv(vector<int> &v)
{
    for (int x : v)
        cout << x << ' ';
    cout << '\n';
}

void solve();

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int tt = 1;
    // cin >> tt;
    while (tt--)
    {
        solve();
        cout << "\n";
    }
    return 0;
}

void solve()
{
    int n, m, s;
    cin >> n >> m >> s;
    auto p = readv(n);
    int ans = s;
    for (int i = 0; i < m; i++)
    {
        int t, q;
        cin >> t >> q;
        int val = p[t - 1] * q;
        val -= (val / 2);
        ans += val;
    }
    cout << ans;
}

Submission Info

Judge Result