Physical Address
304 North Cardinal St.
Dorchester Center, MA 02124
Chef and Time Machine CodeChef Solution
Problem -Chef and Time Machine CodeChef Solution
This website is dedicated for CodeChef solution where we will publish right solution of all your favourite CodeChef problems along with detailed explanatory of different competitive programming concepts and languages.
<<Previous CodeChef Problem Next Codechef Problem>>
Chef and Time Machine CodeChef Solution in C++14
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9+7;
void solve(){
int n, k, m; cin >> n >> k >> m;
int a[n], b[n];
for(int i=0; i<n; i++)
cin >> a[i];
for(int i=0; i<n; i++)
cin >> b[i];
int diff[n];
for(int i=0; i<n; i++){
diff[i]=a[i]-b[i];
}
multiset<int> arr;
for(int i=0; i<k+m; i++){
int tmp; cin >> tmp;
arr.insert(tmp);
}
int ans=0;
for(int i=0; i<n; i++){
auto tmp=arr.upper_bound(diff[i]);
if(tmp!=arr.begin()){
tmp--;
ans+=diff[i]-*tmp;
arr.erase(tmp);
}
else{
ans+=diff[i];
}
}
cout << ans << endl;
return;
}
int32_t main(){
int t=1;
cin >> t;
for(int i=0; i<t; i++)
solve();
return 0;
}Chef and Time Machine CodeChef Solution in PYTH 3
# cook your dish here
t = int(input())
for _ in range(t):
(n,k,m) = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = list(map(int,input().split()))
d = list(map(int,input().split()))
c.extend(d)
diff = [0 for i in range(n)]
for i in range(n): diff[i]=a[i]-b[i]
#print(diff)
diff.sort(reverse=True)
c.sort(reverse=True)
bid = 0
for j in range(n):
while c[bid]>diff[j]:
#print(bid)
bid+=1
if bid>=k+m: break
if bid>=k+m: break
else:
diff[j]-=c[bid]
bid+=1
if bid>=k+m: break
#print(diff)
print(sum(diff))Chef and Time Machine CodeChef Solution in C
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int cmpfunc (const void * a, const void * b) {
return ( *(int*)a - *(int*)b );
}
int main() {
int t,c=0;
scanf("%d",&t);
while(t-->0)
{
int i,n,k,m,j,res=0;
scanf("%d %d %d",&n,&m,&k);
int arr[n];
m+=k;
int a[m];
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&j);
arr[i]-=j;
}
for(i=0;i<m;i++)
scanf("%d",&a[i]);
qsort(arr,n,sizeof(int),cmpfunc);
qsort(a,m,sizeof(int),cmpfunc);
i=n-1;
j=m-1;
while(i>=0&&j>=0)
{
if(a[j]>arr[i])
{
j--;
}
else
{
arr[i]-=a[j];
j--;
i--;
}
}
for(i=0;i<n;i++)
res+=arr[i];
printf("%d\n",res);
}
return 0;
}
Chef and Time Machine CodeChef Solution in JAVA
/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
while(T-->0){
int n = sc.nextInt();
int k = sc.nextInt();
int m = sc.nextInt();
int[] arr = new int[n];
int[] brr = new int[n];
for(int i=0;i<n ;i++){
arr[i]= sc.nextInt();
}
for(int i=0;i<n ;i++){
brr[i]= sc.nextInt();
}
int[] res = new int[k+m];
for(int i=0;i<(k+m);i++){
res[i] =sc.nextInt();
}
int[] diff = new int[n];
for(int i=0;i<n ;i++){
diff[i]= arr[i]-brr[i];
}
Arrays.sort(diff);
Arrays.sort(res);
int i=n-1;
int j=k+m-1;
long f = 0;
while(i>=0&&j>=0){
// System.out.println(diff[i]+" "+res[j]);
if(diff[i]>=res[j]){
f +=diff[i]-res[j];
i--;
j--;
}else{
j--;
}
}
if(i>0){
while(i>=0){
f+=diff[i];
i--;
}
}
System.out.println(f);
}
}
}Chef and Time Machine CodeChef Solution in PYPY 3
t=int(input())
while(t>0):
t-=1
n,k,m=map(int,input().split())
plan=list(map(int,input().split()))
com =list(map(int,input().split()))
w=list(map(int,input().split()))
b=list(map(int,input().split()))
for i in b:
w.append(i)
w=sorted(w)[::-1]
c=[]
for i in range(n):
c.append(plan[i]-com[i])
c=sorted(c)[::-1]
ans=0
x=0
for i in range(n):
if(c[i]==0):
continue
else:
val = c[i]
while(w[x]>val):
x+=1
c[i]-=w[x]
x+=1
if(x>=len(w)):
break
print(sum(c))Chef and Time Machine CodeChef Solution in PYTH
t = int(raw_input())
for i in range(t):
st = raw_input().split()
N = int(st[0])
K = int(st[1])
M = int(st[2])
st1 = raw_input().split()
st2 = raw_input().split()
A = []
tot = 0
for k in range(N):
n = int(st1[k]) - int(st2[k])
if n > 0:
A.append(n)
tot += n
# endif
# endfor k
A.sort()
A.reverse()
B = []
st = raw_input().split()
for x in st:
B.append(int(x))
# endfor x
st = raw_input().split()
for x in st:
B.append(int(x))
# endfor x
B.sort()
B.reverse()
asz = len(A)
bsz = len(B)
p = 0
q = 0
while (p < asz) and (q < bsz):
if B[q] > A[p]:
q += 1
else:
tot -= B[q]
p += 1
q += 1
# endif
# endwhile
print tot
# endfor i
Chef and Time Machine CodeChef Solution in C#
using System;
namespace TimeMachine
{
class Program
{
static void Main(string[] args)
{
int t, n, k, m;
int[] x;
int[] y;
int c;
string[] val = new string[3];
string[] sa,sb,sc,sd = new string[100000];
t=int.Parse(Console.ReadLine());
for (int i = 0; i<t; i++)
{
c = 0;
x= new int[100000];
y= new int[200000];
val = Console.ReadLine().Split(' ');
n = int.Parse(val[0]);
k = int.Parse(val[1]);
m = int.Parse(val[2]);
sa = Console.ReadLine().Split(' ');
sb = Console.ReadLine().Split(' ');
sc = Console.ReadLine().Split(' ');
sd = Console.ReadLine().Split(' ');
for(int j=0; j<n;j++)
{
x[j] = int.Parse(sa[j]) - int.Parse(sb[j]);
}
for(int j=0;j< k;j++)
{
y[j] = int.Parse(sc[j]);
}
for(int j=0;j<m;j++)
{
y[j + k] = int.Parse(sd[j]);
}
Array.Sort(x);
Array.Sort(y);
Array.Reverse(x);
Array.Reverse(y);
int z = 0;
for(int j=0;j< n;j++)
{
c += x[j];
for(int l=z;l<k+m;l++)
{
if(y[l]<= x[j])
{
z = l + 1;
c -= y[l];
break;
}
}
}
Console.WriteLine(c);
}
}
}
}Chef and Time Machine CodeChef Solution Review:
In our experience, we suggest you solve this Chef and Time Machine CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.
If you are stuck anywhere between any coding problem, just visit Queslers to get the Chef and Time Machine CodeChef Solution.
Conclusion:
I hope this Chef and Time Machine CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.
This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.
Keep Learning!
