#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <sstream>
#include <list>
#include <assert.h>
#include <bitset>
#include <numeric>
#define debug() puts("++++")
#define print(x) cout<<(x)<<endl
// #define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x)*(x))
#define ms(a,b) memset(a, b, sizeof a)
#define sz size()
#define be begin()
#define ed end()
#define pu push_up
#define pd push_down
#define cl clear()
#define lowbit(x) -x&x
#define all 1,n,1
#define FOR(i,n,x)  for(int i = (x); i < (n); ++i)
#define freopenr freopen("in.in", "r", stdin)
#define freopenw freopen("out.out", "w", stdout)
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const LL LNF = 1e17;
const double inf = 1e20;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 100000 + 7;
const int maxm = 2000000 + 7;
const LL mod = 1e9 + 7;
const int dr[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dc[] = {0, 0, 1, -1, 1, -1, 1, -1};
int n, m;

inline bool is_in(int r, int c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}
inline int readInt(){
  int x;  cin >> x;  return x;
}

int a[maxn], b[maxn], k[maxn], p[maxn];

int dp[15][1024];

int main(){
  while(scanf("%d %d", &n, &m) == 2){
    for(int i = 0; i < n; ++i)  scanf("%d %d", a+i, b+i);
    for(int i = 0; i < m; ++i)  scanf("%d %d", k+i, p+i);
    ms(dp, INF);
    for(int i = 0; i <= 10; ++i){
      for(int x = 0; x < m; ++x){
        dp[i][0] = 0;
        int blood = p[x] - i;
        if(blood <= 0)  continue;
        for(int j = 1; j <= 1000; ++j)
          dp[i][j] = min(dp[i][j], dp[i][max(0, j-blood)] + k[x]);
      }
    }
    LL ans = 0;
    for(int i = 0; i < n; ++i){
      if(dp[b[i]][a[i]] == INF){
        ans = -1;  break;
      }
      else{
        ans += dp[b[i]][a[i]];
      }
    }
    cout << ans << endl;
  }
  return 0;
}