#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  vector<P> evs;
  int n, m;
  cin >> n >> m;
  VI a(n);
  rep(i, n) cin >> a[i];
  VI b(n);
  rep(i, n) cin >> b[i];
  rep(i, n) evs.emplace_back(a[i], -b[i]);
  VI rest;
  rep(_, m) {
    int t, c;
    cin >> t >> c;
    if (t == 0) {
      evs.emplace_back(c, 0);
    } else {
      rest.emplace_back(c);
    }
  }
  sort(all(evs));
  priority_queue<int> q;
  VI goods;
  int ans = 0;
  for(auto [_, x] : evs) {
    if (x == 0) {
      if (q.size()) {
        ans++;
        q.pop();
      }
    } else {
      q.emplace(-x);
    }
  }
  sort(rall(rest));
  for(int c : rest) {
    while(!q.empty() && q.top() > c) q.pop();
    if (!q.empty()) {
      ans++;
      q.pop();
    }
  }
  cout << n - ans << '\n';
}