New Year Book Reading

New Year Book Reading

New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1 ≤ i ≤ n) book is wi.
As Jaehyun’s house is not large enough to have a bookshelf, he keeps the n books by stacking them vertically. When he wants to read a certain book x, he follows the steps described below.

1.He lifts all the books above book x.
2.He pushes book x out of the stack.
3. He puts down the lifted books without changing their order.
After reading book x, he puts book x on the top of the stack.
Input
The first line contains two space-separated integers n (2 ≤ n ≤ 500) and m (1 ≤ m ≤ 1000) — the number of books, and the number of days for which Jaehyun would read books.
The second line contains n space-separated integers w1, w2, …, wn (1 ≤ wi ≤ 100) — the weight of each book.
The third line contains m space separated integers b1, b2, …, bm (1 ≤ bj ≤ n) — the order of books that he would read. Note that he can read the same book more than once.
Output
Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books.
Examples
Input

3 5
1 2 3
1 3 2 3 1
Output
12

#include"iostream"
#include"cstring"
#include"algorithm"
#include"set"
#include"stack"
using namespace std;
int main()
{
 int n, m;
 int b[1005],a[505];
 while(cin >> n >> m)
 {
  for(int i =0;i < n;i ++)
  {
   cin >> a[i+1];
  }
  stack<int> s,tmp;
  set<int> st;
  for(int i = 0;i < m;i ++)
  {
   cin >> b[i];
   if(!st.count(b[i]))
   {
    tmp.push(b[i]);
    st.insert(b[i]);
   }
  }
  while(!tmp.empty())
  {
   s.push(tmp.top());
   tmp.pop();
  }
  int ans=0;
  for(int i = 0;i < m;i ++)
  {
   while(!s.empty())
   {
    if(b[i]==s.top())
    {
     s.pop();
     while(!tmp.empty())
     {
      
      ans+=a[tmp.top()];
      s.push(tmp.top());
      tmp.pop();
     }
     s.push(b[i]);
     break;
    }
    tmp.push(s.top());
    s.pop();
   }
  }
  cout<<ans<<endl;
 }
 return 0;
}