A
区间求交
T = int(input())
for kase in range(T):
a, b, c, r = [int(x) for x in input().split()]
a, b = min(a,b), max(a,b)
x, y = c-r, c+r
u, v = max(a,x), min(b,y)
# print( (x,y) )
print( (b-a)-max(0,v-u) )
B
排序,最后的方案肯定是前面的一小段每个都单独买,后面跟着若干个长度为 k k k的段
枚举前面这个小段的长度,然后 O ( n k ) O( \frac{n}{k} ) O(kn)算一下
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll n, p, k, a[maxn], s[maxn];
bool check(ll m)
{
ll i, cost=0;
for(i=m;i>0;i-=k)
{
if(i>=k)cost+=a[i];
else cost+=s[i];
}
return cost<=p;
}
int main()
{
ll T=read(), i, j, l, r, mid, ans;
while(T--)
{
n=read(), p=read(), k=read();
rep(i,n)a[i]=read();
sort(a+1,a+n+1);
rep(i,n)s[i]=s[i-1]+a[i];
ans=0;
for(i=0;i<k;i++)
{
ll cost=s[i];
if(cost>p)break;
ans=max(ans,i);
for