Datasets:
Tasks:
Text Generation
Modalities:
Text
Formats:
json
Languages:
English
Size:
< 1K
ArXiv:
Tags:
competitive-programming
code-generation
specification-generation
proof-generation
verification
rust
License:
File size: 1,608 Bytes
b2a430f | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 | impl Solution {
fn ms_merge(a: &Vec<i32>, b: &Vec<i32>) -> Vec<i32> {
let mut result: Vec<i32> = Vec::new();
let mut i: usize = 0;
let mut j: usize = 0;
while i < a.len() || j < b.len()
{
if i < a.len() && (j >= b.len() || a[i] <= b[j]) {
result.push(a[i]);
i = i + 1;
} else {
result.push(b[j]);
j = j + 1;
}
}
result
}
fn ms_sort(nums: &Vec<i32>) -> Vec<i32> {
let n = nums.len();
if n <= 1 {
let mut result = Vec::new();
if n == 1 {
result.push(nums[0]);
}
return result;
}
let mid = n / 2;
let mut left: Vec<i32> = Vec::new();
let mut i: usize = 0;
while i < mid
{
left.push(nums[i]);
i = i + 1;
}
let mut right: Vec<i32> = Vec::new();
let mut j: usize = mid;
while j < n
{
right.push(nums[j]);
j = j + 1;
}
let sorted_left = Self::ms_sort(&left);
let sorted_right = Self::ms_sort(&right);
let result = Self::ms_merge(&sorted_left, &sorted_right);
result
}
pub fn max_coins(piles: Vec<i32>) -> i32 {
let sorted = Self::ms_sort(&piles);
let n = sorted.len();
let mut sum: i32 = 0;
let third = n / 3;
let mut k = third;
while k < n {
sum = sum + sorted[k];
k = k + 2;
}
sum
}
}
|