using
System;
using
System.Collections.Generic;
class
GFG {
static
bool
[] SieveOfEratosThenes(
int
max_val)
{
bool
[] prime =
new
bool
[max_val + 1];
for
(
int
i = 0; i < max_val + 1; i++)
{
prime[i] =
true
;
}
prime[0] =
false
;
prime[1] =
false
;
for
(
int
p = 2; p * p <= max_val; p++)
{
if
(prime[p])
{
for
(
int
i = p * 2; i <= max_val; i += p)
prime[i] =
false
;
}
}
return
prime;
}
static
void
kMinXOR(
int
[] arr,
int
n,
int
k)
{
int
max_val = Int32.MinValue;
for
(
int
i = 0; i < arr.Length; i++)
{
max_val = Math.Max(max_val,arr[i]);
}
bool
[] prime = SieveOfEratosThenes(max_val);
List<
int
> minHeapPrime =
new
List<
int
>();
List<
int
> minHeapNonPrime =
new
List<
int
>();
for
(
int
i = 0; i < n; i++)
{
if
(prime[arr[i]])
{
if
(minHeapPrime.Count < k)
{
minHeapPrime.Add(arr[i]);
}
else
if
(minHeapPrime[0] < arr[i])
{
minHeapPrime.RemoveAt(0);
minHeapPrime.Add(arr[i]);
}
minHeapPrime.Sort();
}
else
if
(arr[i] != -1)
{
if
(minHeapNonPrime.Count < k)
minHeapNonPrime.Add(arr[i]);
else
if
(minHeapNonPrime[0] < arr[i])
{
minHeapNonPrime.RemoveAt(0);
minHeapNonPrime.Add(arr[i]);
}
minHeapNonPrime.Sort();
}
}
long
primeXOR = 0, nonPrimeXor = 0;
while
(k-- > 0)
{
if
(minHeapPrime.Count > 0)
{
primeXOR ^= minHeapPrime[0];
minHeapPrime.RemoveAt(0);
}
if
(minHeapNonPrime.Count > 0)
{
nonPrimeXor ^= minHeapNonPrime[0];
minHeapNonPrime.RemoveAt(0);
}
}
Console.WriteLine(
"Prime XOR = "
+ primeXOR);
Console.WriteLine(
"Composite XOR = "
+ nonPrimeXor);
}
static
void
Main()
{
int
[] arr = { 4, 2, 12, 13, 5, 19 };
int
n = arr.Length;
int
k = 3;
kMinXOR(arr, n, k);
}
}