PROGRAM ATCODER

implicit none
integer(16) :: i,j,n,m,k,s
integer(16),allocatable :: a(:),b(:),c(:)

read*, n,m 
allocate(a(n),b(m),c(m))
read*, a(1:n)
do i = 1, m, 1
  read*, b(i),c(i)
end do

do i = 1, m, 1
  call heapsort(n,a)
  s = bin_s(c(i))-1
  call chmin(s,b(i))
  a(1:s) = c(i)
end do

print'(i0)', sum(a)

contains
  subroutine heapsort(n,array)
  implicit none
  integer(16),intent(in) :: n
  integer(16),intent(inout) :: array(1:n)
  
  integer ::i,k,j,l
  double precision :: t
  
  if(n.le.0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  if(n.eq.1)return

  l=n/2+1
  k=n
  do while(k.ne.1)
     if(l.gt.1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k.eq.1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j.le.k)
        if(j.lt.k)then
           if(array(j).lt.array(j+1))j=j+1
        endif
        if (t.lt.array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
  enddo

  return
  end subroutine heapsort

  logical function isOK(index,key) !indexが条件を満たすかどうか
    implicit none
    integer(16),intent(in) :: index,key
    if ( a(index) >= key ) then !a(index)がkey以上になる最小のindex
      isOK = .true.
    else
      isOK = .false.
    end if
  end function isOK

  integer function bin_s(key)
    implicit none
    integer(16),intent(in) :: key
    integer(16) :: ng,ok,mid
    ng = 0 ; ok = size(a)+1 !初期値の設定は問題によって違う
    !!!!!!while文はどんな場合でも変更しない
    do while ( abs(ok-ng) > 1 )
      mid = (ok+ng)/2
      if ( isOK(mid,key) ) then
        ok = mid
      else
        ng = mid
      end if
    end do
    bin_s = ok
  end function bin_s

  subroutine chmin(dp,x)
  implicit none
  integer(16) :: dp, x

  if (dp > x) then
  	dp = x
  	return
  end if

  end subroutine

END PROGRAM ATCODER