#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } constexpr long long MAX = 5100000; constexpr long long INF = 1LL << 60; constexpr int inf = 1 << 28; constexpr long long mod = 1000000007LL; //constexpr long long mod = 998244353LL; using namespace std; typedef unsigned long long ull; typedef long long ll; ll imos[100500]; int main() { /* cin.tie(nullptr); ios::sync_with_stdio(false); */ ll N, M; scanf("%lld %lld", &N, &M); vector a(N); for (int i = 0; i < N; i++) scanf("%lld", &a[i]); vector x(M), w(M); for (int i = 0; i < M; i++) { scanf("%lld %lld", &x[i], &w[i]); x[i]--; if (a[x[i]] < w[i]) { puts("-1"); return 0; } } ll left = 0; ll right = 1000000001; while (right - left > 1) { ll mid = (right + left) >> 1; for (int i = 0; i <= N; i++) imos[i] = 0; for (ll i = 0; i < M; i++) { ll mx = w[i] / mid; { ll cnt = 0; for (int j = x[i] + 1; j < N && cnt < mx; j++) { cnt++; imos[j] += -mid; } imos[x[i] + 1 + cnt] += -mid * cnt - w[i]; } { ll cnt = 0; int l = max(0LL, x[i] - mx); imos[l] += w[i]; for (ll j = l + 1; j < i; j++) { cnt++; imos[j] += -mid; } imos[l + 1 + cnt] += -mid * cnt; } } for (ll i = 0; i < N; i++) { imos[i + 1] += imos[i]; } bool flag = true; for (ll i = 0; i < N; i++) { if (imos[i] > a[i]) flag = false; } if (flag) right = mid; else left = mid; } cout << left << endl; return 0; /* おまじないを使ったらscanfとprintf関連注意!!!!!!!!!!!! */ }