-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
61 lines (59 loc) · 1.17 KB
/
C.cpp
File metadata and controls
61 lines (59 loc) · 1.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,d,x;
cin>>n>>d;
int a[n],b[n];
loop(i,0,n)
cin>>a[i];
loop(i,0,n)
cin>>b[i];
x=a[d-1]+b[0];
int i=1,j=0;
rloop(k,n)
{
if(j>k)
break;
if(k==d-1)
continue;
//cout<<k<<' '<<a[k]<<endl;
if(a[k]+b[i]<=x)
{
a[k]+=b[i];
i++;
}
else
{
a[j]+=b[i];
i++;
j++;
k++;
//cout<<"hello\n";
}
}
a[d-1]=x;
int ans=1;
loop(i,0,n)
{
if(a[i]>x)
ans++;
//cout<<a[i]<<' ';
}
cout<<ans;
return 0;
}