Tasks Details
medium
1.
DreamTeam
Divide developers into two teams to maximize their total contribution.
Task Score
100%
Correctness
100%
Performance
100%
A company has employed N developers (numbered from 0 to N−1) and wants to divide them into two teams. The first is a front-end team with F developers. The second is a back-end team with N−F developers. If the K-th developer is assigned to the front-end team then their contribution is A[K], and if they are assigned to the back-end team then their contribution is B[K]. What is the maximum sum of contributions the company can achieve?
Write a function:
class Solution { public int solution(int[] A, int[] B, int F); }
that, given two arrays A, B (consisting of N integers each) and the integer F, returns the maximum sum of contributions the company can achieve.
Examples:
1. Given A = [4, 2, 1], B = [2, 5, 3] and F = 2, the function should return 10. There should be two front-end developers and one back-end developer. The 0th and 2nd developers should be assigned to the front-end team (with contributions 4 and 1) and the 1st developer should be assigned to the back-end team (with contribution 5).
2. Given A = [7, 1, 4, 4], B = [5, 3, 4, 3] and F = 2, the function should return 18. The 0th and 3rd developers should be assigned to the front-end team and the 1st and 2nd developers should be assigned to the back-end team.
3. Given A = [5, 5, 5], B = [5, 5, 5] and F = 1, the function should return 15. The 0th developer can be assigned to the front-end team and the 1st and 2nd developers can be assigned to the back-end team.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..200,000];
- arrays A and B have equal lengths;
- each element of array A is an integer within the range [0..1,000];
- F is an integer within the range [0..N].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C#
Time spent on task 19 minutes
Notes
not defined yet
Code: 10:42:22 UTC,
java,
autosave
Code: 10:42:28 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
}
}
Code: 10:43:26 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
}
}
Code: 10:43:26 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[]
for(int i )
}
}
Code: 10:43:42 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = new int[A.length];
for(int i )
}
}
Code: 10:44:09 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = new int[A.length];
for(int i = 0; i < A.length; i++)
}
}
Code: 10:44:23 UTC,
cs,
autosave
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = A.Zip
}
}
Code: 10:44:58 UTC,
cs,
autosave
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = A.Zip
}
}
Code: 10:45:22 UTC,
cs,
autosave
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = A.Zip(B, (f,s) => f - s);
}
}
Code: 10:47:36 UTC,
cs,
autosave
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = A.Zip(B, (f,s) => f - s).to;
}
}
Code: 10:48:27 UTC,
cs,
autosave
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
int[] rslt = A.Zip(B, (f,s) => f - s).;
}
}
Code: 11:00:41 UTC,
cs,
autosave
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> rslt = A.Zip(B, (f, s) => f - s).ToList();
var sortedRslt = rslt.Select((v, i) => new { v, i }).OrderByDescending(t => t.v).ToArray();
int total = 0;
int cnt = 0;
while(cnt < F)
{
total += A[sortedRslt[cnt++].i];
}
while(cnt < A.Length)
{
total += B[sortedRslt[cnt++].i];
}
return total;
}
}
Code: 11:00:44 UTC,
cs,
verify,
result: Passed
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> rslt = A.Zip(B, (f, s) => f - s).ToList();
var sortedRslt = rslt.Select((v, i) => new { v, i }).OrderByDescending(t => t.v).ToArray();
int total = 0;
int cnt = 0;
while(cnt < F)
{
total += A[sortedRslt[cnt++].i];
}
while(cnt < A.Length)
{
total += B[sortedRslt[cnt++].i];
}
return total;
}
}
Analysis
Code: 11:00:52 UTC,
cs,
verify,
result: Passed
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> rslt = A.Zip(B, (f, s) => f - s).ToList();
var sortedRslt = rslt.Select((v, i) => new { v, i }).OrderByDescending(t => t.v).ToArray();
int total = 0;
int cnt = 0;
while(cnt < F)
{
total += A[sortedRslt[cnt++].i];
}
while(cnt < A.Length)
{
total += B[sortedRslt[cnt++].i];
}
return total;
}
}
Analysis
Code: 11:00:58 UTC,
cs,
final,
score:
100
using System;
using System.Collections.Generic;
using System.Linq;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A, int[] B, int F) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
List<int> rslt = A.Zip(B, (f, s) => f - s).ToList();
var sortedRslt = rslt.Select((v, i) => new { v, i }).OrderByDescending(t => t.v).ToArray();
int total = 0;
int cnt = 0;
while(cnt < F)
{
total += A[sortedRslt[cnt++].i];
}
while(cnt < A.Length)
{
total += B[sortedRslt[cnt++].i];
}
return total;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
4.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
small_bigger_and_smaller_differences
N = 20. Some developers have small difference between A[i] and B[i].
N = 20. Some developers have small difference between A[i] and B[i].
✔
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
expand all
Correctness/performance tests
1.
0.028 s
OK
2.
0.032 s
OK
3.
0.028 s
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
medium_bigger_and_smaller_differences
N = 300. Some developers have small difference between A[i] and B[i].
N = 300. Some developers have small difference between A[i] and B[i].
✔
OK
1.
0.028 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
expand all
Performance tests
1.
0.244 s
OK
2.
0.244 s
OK
3.
0.248 s
OK
1.
0.244 s
OK
2.
0.240 s
OK
3.
0.240 s
OK
large_bigger_and_smaller_differences
N = 200,000. Some developers have small difference between A[i] and B[i].
N = 200,000. Some developers have small difference between A[i] and B[i].
✔
OK
1.
0.244 s
OK
2.
0.244 s
OK
3.
0.240 s
OK
1.
0.192 s
OK
2.
0.192 s
OK
3.
0.192 s
OK