Why isn't ElGamal a symmetric-key scheme?
g^x is the public key of Alice and x her private key, while g^y is the public key of Bob and y his private key.

s=g^(xy) is the shared secret between Alice and bob, that can only be computed by them.

Thus, ElGamal is an asymmetric algorithm computing a shared secret that can be used as a symmetric key.