Write a pseudo code to insert new value x to an already sorted array of 1,000,000,000 numbers at its appropriate position in an optimum way?

Write a pseudo code in which using coins of Rs 1 Rs., 2 Rs., 5 Rs. and 10 Rs, find all possible combination of to pay  X amount. X can be any amount. For Example, There are 3 ways to give change for Rs. 4  using coins mentioned above:

1+1+1+1
1+1+2
2+2

I have a structure.
struct {
int a : 8;
int b : 10;
int c : 12;
int d : 4;
int e : 3;
int : 0;
int f : 1;
char g;
} A;

The size of bitfields memory is 48bits.
The size of structure should be 4+4+1 bytes = 9 bytes. What about the memory for variable g. why memory for g is not allocated separately....