Saleh127

Untitled

May 14th, 2020
133
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.15 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define test int t; cin>>t; while (t--)
  4. #define ll long long int
  5. #define sc(a) scanf("%lld",&a)
  6. #define sc2(a,b) scanf("%lld %lld",&a,&b)
  7. int main()
  8. {
  9. ll n,a[10000],c[10000],d,e,f,i,j,k,l,m,o,p;
  10. test
  11. {
  12. d=0;
  13. f=0;
  14. m=0;
  15. cin>>n>>k;
  16. for(i=0;i<n;i++)
  17. {
  18. cin>>a[i];
  19. d+=a[i];
  20. }
  21. for(i=0;i<n;i++)
  22. {
  23. cin>>c[i];
  24. }
  25. sort(a,a+n);
  26. sort(c,c+n,greater<int>());
  27. if(a[0]>=c[0] || k==0)
  28. {
  29. printf("%lld\n",d);
  30. }
  31. else
  32. {
  33. e=0;
  34. for(i=0;i<n;i++)
  35. {
  36. if(m==k) break;
  37. for(j=e;j<n;j++)
  38. {
  39. if(c[j]>a[i])
  40. {
  41. a[i]=c[j];
  42. e=j+1;
  43. m++;
  44. break;
  45. }
  46. }
  47. }
  48. for(l=0;l<n;l++)
  49. {
  50. f+=a[l];
  51. }
  52. printf("%lld\n",f);
  53. }
  54. }
  55. return 0;
  56. }
Advertisement
Add Comment
Please, Sign In to add comment