1 solutions
-
0
C++ :
#include <bits/stdc++.h> using namespace std; int n,k,x,ans,sum; struct data { int t,p; }a[200005]; bool cmp(data a,data b) { return a.t<b.t; } int main() { cin>>n>>k; for(int i=1;i<=n;i++) { cin>>a[i].t; a[i].p=1; } for(int i=n+1;i<=2*n;i++) { cin>>x; a[i].t=x+1; a[i].p=-1; } sort(a+1,a+1+2*n,cmp); ans=0;sum=0; for(int i=1;i<=2*n;i++) { if(a[i].t!=a[i-1].t) { if(sum>=k) ans+=a[i].t-a[i-1].t; } sum+=a[i].p; } cout<<ans; return 0; }
- 1
Information
- ID
- 735
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 10
- Tags
- # Submissions
- 5
- Accepted
- 4
- Uploaded By