hashing function with prioritized inputs

hashing function with prioritized inputs

I am trying to search for a mathematical function for hashing the inputs
which have priorities associated with them.
e.g.
u64 hash_function( int inputArray[10], int priorityArray[10] ) { }
Here zeroth input integer that participates in the hashing has a priority
associated with it.
e.g. inputArray[10] = { 121, 5454, 1212, 543654, 232, 9,21,232, 21, 7 }
priorityArray[10] = { 0,1,2,3,4,5,6,7,8,9}
Thus 0th input 121 has the highest priority of 0 . Which means the
resulting hash should have maximum variance if the 0th input varies, as
opposed to 9th input :7 , which has the lowest priority of 9. Thus even
though 9th input varies the hash value wouldn't change much.
Any suggestion towards a mathematical function (nth order polynomial ? ) ?
Regards