Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.
About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can't pass any exam. It is not allowed to pass more than one exam on any day.
On each day Vasiliy can either pass the exam of that day (it takes the whole day) or prepare all day for some exam or have a rest.
About each subject Vasiliy know a number ai — the number of days he should prepare to pass the exam number i. Vasiliy can switch subjects while preparing for exams, it is not necessary to prepare continuously during ai days for the exam number i. He can mix the order of preparation for exams in any way.
Your task is to determine the minimum number of days in which Vasiliy can pass all exams, or determine that it is impossible. Each exam should be passed exactly one time.
The first line contains two integers n and m (1 ≤ n, m ≤ 105) — the number of days in the exam period and the number of subjects.
The second line contains n integers d1, d2, ..., dn (0 ≤ di ≤ m), where di is the number of subject, the exam of which can be passed on the day number i. If di equals 0, it is not allowed to pass any exams on the day number i.
The third line contains m positive integers a1, a2, ..., am (1 ≤ ai ≤ 105), where ai is the number of days that are needed to prepare before passing the exam on the subject i.
Print one integer — the minimum number of days in which Vasiliy can pass all exams. If it is impossible, print -1.
7 2
0 1 0 2 1 0 2
2 1
5
10 3
0 0 1 2 3 0 2 0 1 2
1 1 4
9
5 1
1 1 1 1 1
5
-1
In the first example Vasiliy can behave as follows. On the first and the second day he can prepare for the exam number 1 and pass it on the fifth day, prepare for the exam number 2 on the third day and pass it on the fourth day.
In the second example Vasiliy should prepare for the exam number 3 during the first four days and pass it on the fifth day. Then on the sixth day he should prepare for the exam number 2 and then pass it on the seventh day. After that he needs to prepare for the exam number 1 on the eighth day and pass it on the ninth day.
In the third example Vasiliy can't pass the only exam because he hasn't anough time to prepare for it.
题意：n天要通过m科考试，d[i]每天可以考哪门科目，a[i]每门科目需要的准备时间，一天可以考试也可以准备，求最少时间
可以二分最少时间，然后贪心判断每门课能不能通过
判断时当然每门科考的越晚越好
// // main.cpp // cf732d // // Created by Candy on 01/11/2016. // Copyright © 2016 Candy. All rights reserved. // #include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; const int N=1e5+5; inline int read(){ char c=getchar();int x=0,f=1; while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();} return x*f; } int n,m,d[N]; struct subject{ int id,late,a; bool operator <(const subject &r)const{return late<r.late;} }s[N]; bool check(int t){//printf("mid %d ",t); for(int i=1;i<=m;i++) s[i].late=0; for(int i=1;i<=t;i++) if(d[i]) s[d[i]].late=i; sort(s+1,s+1+m); int cnt=0,last=0; for(int i=1;i<=m;i++){//printf("%d %d %d %d ",i,s[i].id,s[i].late,cnt); if(s[i].late==0) return false; cnt+=s[i].late-last-1; if(cnt<s[i].a) return false; cnt-=s[i].a; last=s[i].late; } return true; } int main(int argc, const char * argv[]) { n=read();m=read(); for(int i=1;i<=n;i++) d[i]=read(); for(int i=1;i<=m;i++) s[i].a=read(),s[i].id=i; int l=1,r=n,ans=n+1; while(l<=r){ int mid=(l+r)/2; if(check(mid)) ans=min(ans,mid),r=mid-1; else l=mid+1; } if(ans==n+1) printf("-1"); else printf("%d",ans); return 0; }