#include<bits/stdc++.h> using namespace std; int a[11]; int main(){ /** int a[5]={4781,4199,5211,41} ; for(int i=0;i<=4;i++){ cout<<a[i]<<endl; } int b; int a[10]; for(int i=0;i<=10-1;i++){ cin>>a[i]; int max=0; for(int j=0;j<=10-1;j++){ if(a[j]>max){ max = a[j]; b = j+1; } } } cout<<b; int n,sum=0; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ cin>>b[i]; } for(int i=1;i<=n;i++){ sum +=a[i]*b[i]; } cout<<sum<<endl; int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<n;i+=2){ int k=a[i]; a[i] = a[i+1]; a[i+1] = k; } for(int i=1;i<=n;i++){ cout<<a[i]<<" "; } int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ cout<<a[a[i]]<<" "; } int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ cout<<a[a[a[i]]]<<" "; } int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } int max=a[1]; int min=a[1]; for(int i=2;i<=n;i++){ if(a[i]>max){ max = a[i]; } if(a[i]<min){ min = a[i]; } } cout<<max-min; //修改成绩 int n; int id,score; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } cin>>id>>score; a[id] = score; for(int i=1;i<=n;i++){ cout<<a[i]<<" "; } int n; int score; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } int score; for(int i=1;i<=n;i++){ if(a[i]>100){ a[i] = score; } } cout<<score<<" "; int n,m; int s,e; int flag = 0; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } cin>>m; //正向找第一个 for(int i=1;i<=n;i++){ if(a[i]==m){ s = i; flag++; break; } } //逆向找倒数第一个 for(int i=n;i>=1;i--){ if(a[i]==m){ e = i; flag++; break; } } if(flag>0){ cout<<s<<" "<<e<<endl; } else{ cout<<-1<<<endl; } **/ int x=0,h=0; for(int i=1;i<=10;i++){ cin>>a[i]; cin>>h; h+=30; } for(int i=1;i<=10;i++){ if(a[i]<=h) x++; } cout<<x; return 0; }