Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,i,max,n,r,p,j,arr[200],ans;
- int gap,k;
- arr[0]=0;
- cin>>t;
- for(k=0; k<t; k++)
- {
- max=0;
- cin>>n>>r>>p;
- for(i=1; i<=n; i++)
- {
- cin>>arr[i];
- }
- arr[i]=r;
- sort(arr,arr+(n+2));
- for(j=1; j<=(n+1); j++)
- {
- gap=arr[j]-arr[j-1];
- if(gap>max)
- {
- max=gap;
- }
- }
- if(max>p)
- {
- ans=max-p;
- cout<<ans<<endl;
- }
- else
- {
- ans=0;
- cout<<ans<<endl;
- }
- return 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement